/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix049_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:44:20,088 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:44:20,090 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:44:20,109 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:44:20,110 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:44:20,112 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:44:20,114 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:44:20,117 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:44:20,124 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:44:20,126 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:44:20,129 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:44:20,130 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:44:20,131 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:44:20,133 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:44:20,136 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:44:20,138 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:44:20,139 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:44:20,141 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:44:20,142 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:44:20,147 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:44:20,151 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:44:20,155 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:44:20,156 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:44:20,157 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:44:20,159 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:44:20,159 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:44:20,159 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:44:20,161 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:44:20,163 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:44:20,164 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:44:20,164 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:44:20,166 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:44:20,166 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:44:20,167 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:44:20,169 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:44:20,169 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:44:20,169 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:44:20,170 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:44:20,170 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:44:20,171 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:44:20,172 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:44:20,173 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 02:44:20,194 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:44:20,194 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:44:20,196 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:44:20,196 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:44:20,197 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:44:20,197 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:44:20,197 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:44:20,197 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:44:20,198 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:44:20,198 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:44:20,199 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:44:20,199 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:44:20,199 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:44:20,200 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:44:20,200 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:44:20,200 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:44:20,200 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:44:20,201 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:44:20,201 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:44:20,201 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:44:20,201 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:44:20,201 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:44:20,202 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:44:20,202 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:44:20,202 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:44:20,202 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:44:20,202 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:44:20,203 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:44:20,203 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:44:20,466 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:44:20,485 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:44:20,488 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:44:20,489 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:44:20,490 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:44:20,490 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix049_power.opt.i [2019-12-27 02:44:20,577 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48400a2c6/fc2c4969380a430889cc19d6957ab69e/FLAG6d8f52910 [2019-12-27 02:44:21,159 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:44:21,159 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix049_power.opt.i [2019-12-27 02:44:21,176 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48400a2c6/fc2c4969380a430889cc19d6957ab69e/FLAG6d8f52910 [2019-12-27 02:44:21,410 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48400a2c6/fc2c4969380a430889cc19d6957ab69e [2019-12-27 02:44:21,418 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:44:21,420 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:44:21,421 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:44:21,421 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:44:21,425 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:44:21,426 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:44:21" (1/1) ... [2019-12-27 02:44:21,429 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e50f93c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:44:21, skipping insertion in model container [2019-12-27 02:44:21,429 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:44:21" (1/1) ... [2019-12-27 02:44:21,438 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:44:21,490 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:44:22,122 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:44:22,133 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:44:22,196 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:44:22,282 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:44:22,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:44:22 WrapperNode [2019-12-27 02:44:22,283 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:44:22,284 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:44:22,284 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:44:22,284 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:44:22,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:44:22" (1/1) ... [2019-12-27 02:44:22,313 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:44:22" (1/1) ... [2019-12-27 02:44:22,343 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:44:22,344 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:44:22,344 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:44:22,344 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:44:22,355 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:44:22" (1/1) ... [2019-12-27 02:44:22,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:44:22" (1/1) ... [2019-12-27 02:44:22,365 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:44:22" (1/1) ... [2019-12-27 02:44:22,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:44:22" (1/1) ... [2019-12-27 02:44:22,386 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:44:22" (1/1) ... [2019-12-27 02:44:22,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:44:22" (1/1) ... [2019-12-27 02:44:22,405 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:44:22" (1/1) ... [2019-12-27 02:44:22,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:44:22,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:44:22,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:44:22,419 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:44:22,421 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:44:22" (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 02:44:22,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:44:22,502 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:44:22,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:44:22,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:44:22,503 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:44:22,503 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:44:22,504 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:44:22,505 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:44:22,506 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:44:22,506 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:44:22,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:44:22,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:44:22,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:44:22,511 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 02:44:23,408 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:44:23,409 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:44:23,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:44:23 BoogieIcfgContainer [2019-12-27 02:44:23,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:44:23,412 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:44:23,412 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:44:23,415 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:44:23,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:44:21" (1/3) ... [2019-12-27 02:44:23,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1008e0d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:44:23, skipping insertion in model container [2019-12-27 02:44:23,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:44:22" (2/3) ... [2019-12-27 02:44:23,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1008e0d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:44:23, skipping insertion in model container [2019-12-27 02:44:23,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:44:23" (3/3) ... [2019-12-27 02:44:23,419 INFO L109 eAbstractionObserver]: Analyzing ICFG mix049_power.opt.i [2019-12-27 02:44:23,430 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:44:23,431 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:44:23,439 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:44:23,440 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:44:23,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,485 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,486 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,486 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,487 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,487 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,495 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,496 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,521 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,522 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,549 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,551 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,558 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,559 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,559 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,561 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,561 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:44:23,579 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 02:44:23,599 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:44:23,600 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:44:23,600 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:44:23,600 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:44:23,600 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:44:23,600 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:44:23,600 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:44:23,600 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:44:23,617 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-27 02:44:23,619 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 02:44:23,726 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 02:44:23,726 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:44:23,742 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 02:44:23,770 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 02:44:23,828 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 02:44:23,829 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:44:23,839 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 02:44:23,864 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 02:44:23,865 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:44:29,205 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 02:44:29,337 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 02:44:29,703 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130045 [2019-12-27 02:44:29,703 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-27 02:44:29,707 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-27 02:44:54,229 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 126452 states. [2019-12-27 02:44:54,231 INFO L276 IsEmpty]: Start isEmpty. Operand 126452 states. [2019-12-27 02:44:54,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 02:44:54,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:44:54,237 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 02:44:54,238 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:44:54,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:44:54,244 INFO L82 PathProgramCache]: Analyzing trace with hash 913925, now seen corresponding path program 1 times [2019-12-27 02:44:54,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:44:54,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910459886] [2019-12-27 02:44:54,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:44:54,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:44:54,494 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 02:44:54,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910459886] [2019-12-27 02:44:54,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:44:54,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:44:54,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460504564] [2019-12-27 02:44:54,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:44:54,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:44:54,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:44:54,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:44:54,520 INFO L87 Difference]: Start difference. First operand 126452 states. Second operand 3 states. [2019-12-27 02:44:57,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:44:57,465 INFO L93 Difference]: Finished difference Result 125570 states and 538788 transitions. [2019-12-27 02:44:57,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:44:57,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 02:44:57,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:44:58,267 INFO L225 Difference]: With dead ends: 125570 [2019-12-27 02:44:58,267 INFO L226 Difference]: Without dead ends: 111010 [2019-12-27 02:44:58,269 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 02:45:05,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111010 states. [2019-12-27 02:45:08,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111010 to 111010. [2019-12-27 02:45:08,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111010 states. [2019-12-27 02:45:12,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111010 states to 111010 states and 475060 transitions. [2019-12-27 02:45:12,681 INFO L78 Accepts]: Start accepts. Automaton has 111010 states and 475060 transitions. Word has length 3 [2019-12-27 02:45:12,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:45:12,681 INFO L462 AbstractCegarLoop]: Abstraction has 111010 states and 475060 transitions. [2019-12-27 02:45:12,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:45:12,681 INFO L276 IsEmpty]: Start isEmpty. Operand 111010 states and 475060 transitions. [2019-12-27 02:45:12,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 02:45:12,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:45:12,686 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:45:12,686 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:45:12,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:45:12,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1753094800, now seen corresponding path program 1 times [2019-12-27 02:45:12,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:45:12,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766532570] [2019-12-27 02:45:12,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:45:12,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:45:12,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:45:12,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766532570] [2019-12-27 02:45:12,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:45:12,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:45:12,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812968117] [2019-12-27 02:45:12,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:45:12,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:45:12,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:45:12,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:45:12,798 INFO L87 Difference]: Start difference. First operand 111010 states and 475060 transitions. Second operand 4 states. [2019-12-27 02:45:14,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:45:14,109 INFO L93 Difference]: Finished difference Result 172646 states and 710109 transitions. [2019-12-27 02:45:14,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:45:14,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 02:45:14,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:45:19,827 INFO L225 Difference]: With dead ends: 172646 [2019-12-27 02:45:19,827 INFO L226 Difference]: Without dead ends: 172548 [2019-12-27 02:45:19,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:45:25,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172548 states. [2019-12-27 02:45:28,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172548 to 158936. [2019-12-27 02:45:28,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158936 states. [2019-12-27 02:45:29,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158936 states to 158936 states and 661803 transitions. [2019-12-27 02:45:29,945 INFO L78 Accepts]: Start accepts. Automaton has 158936 states and 661803 transitions. Word has length 11 [2019-12-27 02:45:29,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:45:29,946 INFO L462 AbstractCegarLoop]: Abstraction has 158936 states and 661803 transitions. [2019-12-27 02:45:29,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:45:29,946 INFO L276 IsEmpty]: Start isEmpty. Operand 158936 states and 661803 transitions. [2019-12-27 02:45:29,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 02:45:29,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:45:29,952 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:45:29,952 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:45:29,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:45:29,952 INFO L82 PathProgramCache]: Analyzing trace with hash 216434073, now seen corresponding path program 1 times [2019-12-27 02:45:29,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:45:29,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6339363] [2019-12-27 02:45:29,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:45:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:45:30,025 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 02:45:30,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6339363] [2019-12-27 02:45:30,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:45:30,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:45:30,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385962239] [2019-12-27 02:45:30,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:45:30,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:45:30,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:45:30,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:45:30,027 INFO L87 Difference]: Start difference. First operand 158936 states and 661803 transitions. Second operand 3 states. [2019-12-27 02:45:30,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:45:30,180 INFO L93 Difference]: Finished difference Result 34208 states and 111904 transitions. [2019-12-27 02:45:30,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:45:30,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 02:45:30,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:45:30,329 INFO L225 Difference]: With dead ends: 34208 [2019-12-27 02:45:30,329 INFO L226 Difference]: Without dead ends: 34208 [2019-12-27 02:45:30,330 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 02:45:30,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34208 states. [2019-12-27 02:45:31,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34208 to 34208. [2019-12-27 02:45:31,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34208 states. [2019-12-27 02:45:31,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34208 states to 34208 states and 111904 transitions. [2019-12-27 02:45:31,080 INFO L78 Accepts]: Start accepts. Automaton has 34208 states and 111904 transitions. Word has length 13 [2019-12-27 02:45:31,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:45:31,081 INFO L462 AbstractCegarLoop]: Abstraction has 34208 states and 111904 transitions. [2019-12-27 02:45:31,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:45:31,081 INFO L276 IsEmpty]: Start isEmpty. Operand 34208 states and 111904 transitions. [2019-12-27 02:45:31,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 02:45:31,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:45:31,084 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:45:31,085 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:45:31,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:45:31,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1948590504, now seen corresponding path program 1 times [2019-12-27 02:45:31,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:45:31,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429124562] [2019-12-27 02:45:31,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:45:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:45:31,144 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 02:45:31,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429124562] [2019-12-27 02:45:31,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:45:31,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:45:31,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59524947] [2019-12-27 02:45:31,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:45:31,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:45:31,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:45:31,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:45:31,147 INFO L87 Difference]: Start difference. First operand 34208 states and 111904 transitions. Second operand 3 states. [2019-12-27 02:45:31,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:45:31,402 INFO L93 Difference]: Finished difference Result 51809 states and 168645 transitions. [2019-12-27 02:45:31,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:45:31,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 02:45:31,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:45:31,518 INFO L225 Difference]: With dead ends: 51809 [2019-12-27 02:45:31,518 INFO L226 Difference]: Without dead ends: 51809 [2019-12-27 02:45:31,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:45:32,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51809 states. [2019-12-27 02:45:32,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51809 to 38969. [2019-12-27 02:45:32,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38969 states. [2019-12-27 02:45:32,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38969 states to 38969 states and 128499 transitions. [2019-12-27 02:45:32,847 INFO L78 Accepts]: Start accepts. Automaton has 38969 states and 128499 transitions. Word has length 16 [2019-12-27 02:45:32,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:45:32,848 INFO L462 AbstractCegarLoop]: Abstraction has 38969 states and 128499 transitions. [2019-12-27 02:45:32,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:45:32,848 INFO L276 IsEmpty]: Start isEmpty. Operand 38969 states and 128499 transitions. [2019-12-27 02:45:32,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 02:45:32,851 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:45:32,851 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:45:32,851 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:45:32,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:45:32,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1821591471, now seen corresponding path program 1 times [2019-12-27 02:45:32,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:45:32,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118007133] [2019-12-27 02:45:32,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:45:32,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:45:32,938 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 02:45:32,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118007133] [2019-12-27 02:45:32,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:45:32,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:45:32,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928935585] [2019-12-27 02:45:32,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:45:32,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:45:32,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:45:32,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:45:32,941 INFO L87 Difference]: Start difference. First operand 38969 states and 128499 transitions. Second operand 5 states. [2019-12-27 02:45:33,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:45:33,523 INFO L93 Difference]: Finished difference Result 53507 states and 173644 transitions. [2019-12-27 02:45:33,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:45:33,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 02:45:33,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:45:33,619 INFO L225 Difference]: With dead ends: 53507 [2019-12-27 02:45:33,620 INFO L226 Difference]: Without dead ends: 53507 [2019-12-27 02:45:33,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:45:33,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53507 states. [2019-12-27 02:45:34,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53507 to 44557. [2019-12-27 02:45:34,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44557 states. [2019-12-27 02:45:34,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44557 states to 44557 states and 146077 transitions. [2019-12-27 02:45:34,943 INFO L78 Accepts]: Start accepts. Automaton has 44557 states and 146077 transitions. Word has length 16 [2019-12-27 02:45:34,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:45:34,943 INFO L462 AbstractCegarLoop]: Abstraction has 44557 states and 146077 transitions. [2019-12-27 02:45:34,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:45:34,943 INFO L276 IsEmpty]: Start isEmpty. Operand 44557 states and 146077 transitions. [2019-12-27 02:45:34,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 02:45:34,957 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:45:34,957 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 02:45:34,958 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:45:34,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:45:34,958 INFO L82 PathProgramCache]: Analyzing trace with hash -187432510, now seen corresponding path program 1 times [2019-12-27 02:45:34,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:45:34,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717939956] [2019-12-27 02:45:34,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:45:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:45:35,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:45:35,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717939956] [2019-12-27 02:45:35,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:45:35,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:45:35,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238218459] [2019-12-27 02:45:35,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:45:35,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:45:35,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:45:35,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:45:35,093 INFO L87 Difference]: Start difference. First operand 44557 states and 146077 transitions. Second operand 6 states. [2019-12-27 02:45:36,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:45:36,098 INFO L93 Difference]: Finished difference Result 66834 states and 212729 transitions. [2019-12-27 02:45:36,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:45:36,098 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 02:45:36,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:45:36,216 INFO L225 Difference]: With dead ends: 66834 [2019-12-27 02:45:36,216 INFO L226 Difference]: Without dead ends: 66820 [2019-12-27 02:45:36,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 02:45:36,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66820 states. [2019-12-27 02:45:37,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66820 to 44208. [2019-12-27 02:45:37,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44208 states. [2019-12-27 02:45:37,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44208 states to 44208 states and 144750 transitions. [2019-12-27 02:45:37,723 INFO L78 Accepts]: Start accepts. Automaton has 44208 states and 144750 transitions. Word has length 22 [2019-12-27 02:45:37,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:45:37,724 INFO L462 AbstractCegarLoop]: Abstraction has 44208 states and 144750 transitions. [2019-12-27 02:45:37,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:45:37,724 INFO L276 IsEmpty]: Start isEmpty. Operand 44208 states and 144750 transitions. [2019-12-27 02:45:37,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 02:45:37,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:45:37,743 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 02:45:37,743 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:45:37,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:45:37,744 INFO L82 PathProgramCache]: Analyzing trace with hash -200714255, now seen corresponding path program 1 times [2019-12-27 02:45:37,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:45:37,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539525540] [2019-12-27 02:45:37,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:45:37,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:45:37,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:45:37,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539525540] [2019-12-27 02:45:37,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:45:37,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:45:37,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537333147] [2019-12-27 02:45:37,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:45:37,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:45:37,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:45:37,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:45:37,795 INFO L87 Difference]: Start difference. First operand 44208 states and 144750 transitions. Second operand 4 states. [2019-12-27 02:45:37,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:45:37,868 INFO L93 Difference]: Finished difference Result 18127 states and 56319 transitions. [2019-12-27 02:45:37,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:45:37,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 02:45:37,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:45:37,894 INFO L225 Difference]: With dead ends: 18127 [2019-12-27 02:45:37,894 INFO L226 Difference]: Without dead ends: 18127 [2019-12-27 02:45:37,895 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 02:45:37,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18127 states. [2019-12-27 02:45:38,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18127 to 17799. [2019-12-27 02:45:38,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17799 states. [2019-12-27 02:45:38,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17799 states to 17799 states and 55383 transitions. [2019-12-27 02:45:38,175 INFO L78 Accepts]: Start accepts. Automaton has 17799 states and 55383 transitions. Word has length 25 [2019-12-27 02:45:38,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:45:38,175 INFO L462 AbstractCegarLoop]: Abstraction has 17799 states and 55383 transitions. [2019-12-27 02:45:38,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:45:38,176 INFO L276 IsEmpty]: Start isEmpty. Operand 17799 states and 55383 transitions. [2019-12-27 02:45:38,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 02:45:38,189 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:45:38,190 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] [2019-12-27 02:45:38,190 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:45:38,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:45:38,190 INFO L82 PathProgramCache]: Analyzing trace with hash 611460705, now seen corresponding path program 1 times [2019-12-27 02:45:38,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:45:38,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890169991] [2019-12-27 02:45:38,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:45:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:45:38,269 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 02:45:38,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890169991] [2019-12-27 02:45:38,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:45:38,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:45:38,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017116648] [2019-12-27 02:45:38,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:45:38,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:45:38,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:45:38,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:45:38,271 INFO L87 Difference]: Start difference. First operand 17799 states and 55383 transitions. Second operand 6 states. [2019-12-27 02:45:38,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:45:38,857 INFO L93 Difference]: Finished difference Result 25206 states and 75658 transitions. [2019-12-27 02:45:38,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 02:45:38,857 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 02:45:38,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:45:38,894 INFO L225 Difference]: With dead ends: 25206 [2019-12-27 02:45:38,894 INFO L226 Difference]: Without dead ends: 25206 [2019-12-27 02:45:38,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:45:38,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25206 states. [2019-12-27 02:45:39,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25206 to 20596. [2019-12-27 02:45:39,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20596 states. [2019-12-27 02:45:39,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20596 states to 20596 states and 63178 transitions. [2019-12-27 02:45:39,249 INFO L78 Accepts]: Start accepts. Automaton has 20596 states and 63178 transitions. Word has length 27 [2019-12-27 02:45:39,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:45:39,250 INFO L462 AbstractCegarLoop]: Abstraction has 20596 states and 63178 transitions. [2019-12-27 02:45:39,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:45:39,250 INFO L276 IsEmpty]: Start isEmpty. Operand 20596 states and 63178 transitions. [2019-12-27 02:45:39,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 02:45:39,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:45:39,273 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] [2019-12-27 02:45:39,273 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:45:39,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:45:39,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1170391984, now seen corresponding path program 1 times [2019-12-27 02:45:39,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:45:39,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000604452] [2019-12-27 02:45:39,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:45:39,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:45:39,365 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 02:45:39,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000604452] [2019-12-27 02:45:39,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:45:39,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:45:39,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612410899] [2019-12-27 02:45:39,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:45:39,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:45:39,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:45:39,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:45:39,367 INFO L87 Difference]: Start difference. First operand 20596 states and 63178 transitions. Second operand 7 states. [2019-12-27 02:45:40,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:45:40,839 INFO L93 Difference]: Finished difference Result 28185 states and 83945 transitions. [2019-12-27 02:45:40,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 02:45:40,840 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 02:45:40,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:45:40,879 INFO L225 Difference]: With dead ends: 28185 [2019-12-27 02:45:40,879 INFO L226 Difference]: Without dead ends: 28185 [2019-12-27 02:45:40,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 02:45:40,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28185 states. [2019-12-27 02:45:41,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28185 to 19533. [2019-12-27 02:45:41,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19533 states. [2019-12-27 02:45:41,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19533 states to 19533 states and 59996 transitions. [2019-12-27 02:45:41,237 INFO L78 Accepts]: Start accepts. Automaton has 19533 states and 59996 transitions. Word has length 33 [2019-12-27 02:45:41,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:45:41,237 INFO L462 AbstractCegarLoop]: Abstraction has 19533 states and 59996 transitions. [2019-12-27 02:45:41,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:45:41,238 INFO L276 IsEmpty]: Start isEmpty. Operand 19533 states and 59996 transitions. [2019-12-27 02:45:41,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 02:45:41,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:45:41,265 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 02:45:41,265 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:45:41,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:45:41,265 INFO L82 PathProgramCache]: Analyzing trace with hash -471967596, now seen corresponding path program 1 times [2019-12-27 02:45:41,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:45:41,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829281425] [2019-12-27 02:45:41,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:45:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:45:41,333 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 02:45:41,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829281425] [2019-12-27 02:45:41,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:45:41,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:45:41,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517256116] [2019-12-27 02:45:41,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:45:41,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:45:41,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:45:41,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:45:41,335 INFO L87 Difference]: Start difference. First operand 19533 states and 59996 transitions. Second operand 5 states. [2019-12-27 02:45:41,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:45:41,436 INFO L93 Difference]: Finished difference Result 18279 states and 57074 transitions. [2019-12-27 02:45:41,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:45:41,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 02:45:41,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:45:41,473 INFO L225 Difference]: With dead ends: 18279 [2019-12-27 02:45:41,473 INFO L226 Difference]: Without dead ends: 18279 [2019-12-27 02:45:41,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:45:41,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18279 states. [2019-12-27 02:45:41,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18279 to 17698. [2019-12-27 02:45:41,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17698 states. [2019-12-27 02:45:41,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17698 states to 17698 states and 55505 transitions. [2019-12-27 02:45:41,830 INFO L78 Accepts]: Start accepts. Automaton has 17698 states and 55505 transitions. Word has length 39 [2019-12-27 02:45:41,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:45:41,831 INFO L462 AbstractCegarLoop]: Abstraction has 17698 states and 55505 transitions. [2019-12-27 02:45:41,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:45:41,831 INFO L276 IsEmpty]: Start isEmpty. Operand 17698 states and 55505 transitions. [2019-12-27 02:45:41,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:45:41,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:45:41,856 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:45:41,856 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:45:41,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:45:41,856 INFO L82 PathProgramCache]: Analyzing trace with hash -2116688157, now seen corresponding path program 1 times [2019-12-27 02:45:41,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:45:41,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720068119] [2019-12-27 02:45:41,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:45:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:45:41,975 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 02:45:41,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720068119] [2019-12-27 02:45:41,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:45:41,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:45:41,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334573535] [2019-12-27 02:45:41,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:45:41,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:45:41,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:45:41,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:45:41,979 INFO L87 Difference]: Start difference. First operand 17698 states and 55505 transitions. Second operand 7 states. [2019-12-27 02:45:42,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:45:42,534 INFO L93 Difference]: Finished difference Result 48537 states and 151835 transitions. [2019-12-27 02:45:42,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:45:42,535 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 02:45:42,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:45:42,617 INFO L225 Difference]: With dead ends: 48537 [2019-12-27 02:45:42,617 INFO L226 Difference]: Without dead ends: 38006 [2019-12-27 02:45:42,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 02:45:42,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38006 states. [2019-12-27 02:45:43,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38006 to 21047. [2019-12-27 02:45:43,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21047 states. [2019-12-27 02:45:43,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21047 states to 21047 states and 66538 transitions. [2019-12-27 02:45:43,649 INFO L78 Accepts]: Start accepts. Automaton has 21047 states and 66538 transitions. Word has length 64 [2019-12-27 02:45:43,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:45:43,650 INFO L462 AbstractCegarLoop]: Abstraction has 21047 states and 66538 transitions. [2019-12-27 02:45:43,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:45:43,650 INFO L276 IsEmpty]: Start isEmpty. Operand 21047 states and 66538 transitions. [2019-12-27 02:45:43,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:45:43,676 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:45:43,676 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:45:43,676 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:45:43,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:45:43,676 INFO L82 PathProgramCache]: Analyzing trace with hash -978914267, now seen corresponding path program 2 times [2019-12-27 02:45:43,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:45:43,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665813291] [2019-12-27 02:45:43,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:45:43,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:45:43,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:45:43,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665813291] [2019-12-27 02:45:43,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:45:43,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:45:43,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439887797] [2019-12-27 02:45:43,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:45:43,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:45:43,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:45:43,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:45:43,804 INFO L87 Difference]: Start difference. First operand 21047 states and 66538 transitions. Second operand 7 states. [2019-12-27 02:45:44,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:45:44,329 INFO L93 Difference]: Finished difference Result 57554 states and 178145 transitions. [2019-12-27 02:45:44,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:45:44,329 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 02:45:44,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:45:44,394 INFO L225 Difference]: With dead ends: 57554 [2019-12-27 02:45:44,394 INFO L226 Difference]: Without dead ends: 41745 [2019-12-27 02:45:44,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 02:45:44,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41745 states. [2019-12-27 02:45:44,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41745 to 24743. [2019-12-27 02:45:44,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24743 states. [2019-12-27 02:45:44,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24743 states to 24743 states and 78318 transitions. [2019-12-27 02:45:44,980 INFO L78 Accepts]: Start accepts. Automaton has 24743 states and 78318 transitions. Word has length 64 [2019-12-27 02:45:44,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:45:44,980 INFO L462 AbstractCegarLoop]: Abstraction has 24743 states and 78318 transitions. [2019-12-27 02:45:44,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:45:44,980 INFO L276 IsEmpty]: Start isEmpty. Operand 24743 states and 78318 transitions. [2019-12-27 02:45:45,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:45:45,014 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:45:45,014 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:45:45,014 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:45:45,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:45:45,015 INFO L82 PathProgramCache]: Analyzing trace with hash -423923923, now seen corresponding path program 3 times [2019-12-27 02:45:45,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:45:45,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019074239] [2019-12-27 02:45:45,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:45:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:45:45,115 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 02:45:45,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019074239] [2019-12-27 02:45:45,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:45:45,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:45:45,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847725834] [2019-12-27 02:45:45,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:45:45,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:45:45,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:45:45,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:45:45,117 INFO L87 Difference]: Start difference. First operand 24743 states and 78318 transitions. Second operand 7 states. [2019-12-27 02:45:45,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:45:45,590 INFO L93 Difference]: Finished difference Result 51247 states and 161421 transitions. [2019-12-27 02:45:45,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 02:45:45,591 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 02:45:45,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:45:45,665 INFO L225 Difference]: With dead ends: 51247 [2019-12-27 02:45:45,665 INFO L226 Difference]: Without dead ends: 47407 [2019-12-27 02:45:45,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 02:45:45,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47407 states. [2019-12-27 02:45:46,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47407 to 24923. [2019-12-27 02:45:46,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24923 states. [2019-12-27 02:45:46,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24923 states to 24923 states and 79050 transitions. [2019-12-27 02:45:46,669 INFO L78 Accepts]: Start accepts. Automaton has 24923 states and 79050 transitions. Word has length 64 [2019-12-27 02:45:46,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:45:46,669 INFO L462 AbstractCegarLoop]: Abstraction has 24923 states and 79050 transitions. [2019-12-27 02:45:46,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:45:46,669 INFO L276 IsEmpty]: Start isEmpty. Operand 24923 states and 79050 transitions. [2019-12-27 02:45:46,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:45:46,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:45:46,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:45:46,713 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:45:46,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:45:46,713 INFO L82 PathProgramCache]: Analyzing trace with hash -314768521, now seen corresponding path program 4 times [2019-12-27 02:45:46,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:45:46,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289727288] [2019-12-27 02:45:46,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:45:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:45:46,797 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 02:45:46,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289727288] [2019-12-27 02:45:46,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:45:46,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:45:46,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326967702] [2019-12-27 02:45:46,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:45:46,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:45:46,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:45:46,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:45:46,800 INFO L87 Difference]: Start difference. First operand 24923 states and 79050 transitions. Second operand 3 states. [2019-12-27 02:45:46,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:45:46,899 INFO L93 Difference]: Finished difference Result 20919 states and 64986 transitions. [2019-12-27 02:45:46,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:45:46,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 02:45:46,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:45:46,940 INFO L225 Difference]: With dead ends: 20919 [2019-12-27 02:45:46,940 INFO L226 Difference]: Without dead ends: 20919 [2019-12-27 02:45:46,941 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 02:45:47,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20919 states. [2019-12-27 02:45:47,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20919 to 19827. [2019-12-27 02:45:47,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19827 states. [2019-12-27 02:45:47,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19827 states to 19827 states and 61272 transitions. [2019-12-27 02:45:47,444 INFO L78 Accepts]: Start accepts. Automaton has 19827 states and 61272 transitions. Word has length 64 [2019-12-27 02:45:47,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:45:47,444 INFO L462 AbstractCegarLoop]: Abstraction has 19827 states and 61272 transitions. [2019-12-27 02:45:47,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:45:47,445 INFO L276 IsEmpty]: Start isEmpty. Operand 19827 states and 61272 transitions. [2019-12-27 02:45:47,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:45:47,479 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:45:47,479 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:45:47,479 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:45:47,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:45:47,480 INFO L82 PathProgramCache]: Analyzing trace with hash 231413698, now seen corresponding path program 1 times [2019-12-27 02:45:47,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:45:47,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012934026] [2019-12-27 02:45:47,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:45:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:45:47,579 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 02:45:47,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012934026] [2019-12-27 02:45:47,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:45:47,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:45:47,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284772890] [2019-12-27 02:45:47,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:45:47,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:45:47,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:45:47,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:45:47,581 INFO L87 Difference]: Start difference. First operand 19827 states and 61272 transitions. Second operand 3 states. [2019-12-27 02:45:47,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:45:47,725 INFO L93 Difference]: Finished difference Result 24197 states and 74265 transitions. [2019-12-27 02:45:47,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:45:47,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 02:45:47,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:45:47,769 INFO L225 Difference]: With dead ends: 24197 [2019-12-27 02:45:47,769 INFO L226 Difference]: Without dead ends: 24197 [2019-12-27 02:45:47,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 02:45:47,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24197 states. [2019-12-27 02:45:48,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24197 to 21036. [2019-12-27 02:45:48,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21036 states. [2019-12-27 02:45:48,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21036 states to 21036 states and 65069 transitions. [2019-12-27 02:45:48,139 INFO L78 Accepts]: Start accepts. Automaton has 21036 states and 65069 transitions. Word has length 65 [2019-12-27 02:45:48,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:45:48,140 INFO L462 AbstractCegarLoop]: Abstraction has 21036 states and 65069 transitions. [2019-12-27 02:45:48,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:45:48,140 INFO L276 IsEmpty]: Start isEmpty. Operand 21036 states and 65069 transitions. [2019-12-27 02:45:48,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:45:48,165 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:45:48,165 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:45:48,165 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:45:48,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:45:48,165 INFO L82 PathProgramCache]: Analyzing trace with hash 198410648, now seen corresponding path program 1 times [2019-12-27 02:45:48,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:45:48,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157139719] [2019-12-27 02:45:48,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:45:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:45:48,239 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 02:45:48,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157139719] [2019-12-27 02:45:48,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:45:48,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:45:48,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506654093] [2019-12-27 02:45:48,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:45:48,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:45:48,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:45:48,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:45:48,241 INFO L87 Difference]: Start difference. First operand 21036 states and 65069 transitions. Second operand 4 states. [2019-12-27 02:45:48,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:45:48,415 INFO L93 Difference]: Finished difference Result 24621 states and 75632 transitions. [2019-12-27 02:45:48,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:45:48,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 02:45:48,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:45:48,448 INFO L225 Difference]: With dead ends: 24621 [2019-12-27 02:45:48,449 INFO L226 Difference]: Without dead ends: 24621 [2019-12-27 02:45:48,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 02:45:48,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24621 states. [2019-12-27 02:45:48,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24621 to 21144. [2019-12-27 02:45:48,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21144 states. [2019-12-27 02:45:48,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21144 states to 21144 states and 65300 transitions. [2019-12-27 02:45:48,808 INFO L78 Accepts]: Start accepts. Automaton has 21144 states and 65300 transitions. Word has length 66 [2019-12-27 02:45:48,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:45:48,808 INFO L462 AbstractCegarLoop]: Abstraction has 21144 states and 65300 transitions. [2019-12-27 02:45:48,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:45:48,808 INFO L276 IsEmpty]: Start isEmpty. Operand 21144 states and 65300 transitions. [2019-12-27 02:45:48,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:45:48,832 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:45:48,832 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:45:48,832 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:45:48,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:45:48,833 INFO L82 PathProgramCache]: Analyzing trace with hash 745619748, now seen corresponding path program 1 times [2019-12-27 02:45:48,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:45:48,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618919528] [2019-12-27 02:45:48,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:45:48,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:45:48,987 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 02:45:48,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618919528] [2019-12-27 02:45:48,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:45:48,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:45:48,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024260981] [2019-12-27 02:45:48,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 02:45:48,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:45:48,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 02:45:48,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:45:48,990 INFO L87 Difference]: Start difference. First operand 21144 states and 65300 transitions. Second operand 10 states. [2019-12-27 02:45:51,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:45:51,374 INFO L93 Difference]: Finished difference Result 38488 states and 118451 transitions. [2019-12-27 02:45:51,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 02:45:51,375 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 02:45:51,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:45:51,453 INFO L225 Difference]: With dead ends: 38488 [2019-12-27 02:45:51,453 INFO L226 Difference]: Without dead ends: 30672 [2019-12-27 02:45:51,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2019-12-27 02:45:51,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30672 states. [2019-12-27 02:45:51,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30672 to 21745. [2019-12-27 02:45:51,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21745 states. [2019-12-27 02:45:52,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21745 states to 21745 states and 67061 transitions. [2019-12-27 02:45:52,009 INFO L78 Accepts]: Start accepts. Automaton has 21745 states and 67061 transitions. Word has length 66 [2019-12-27 02:45:52,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:45:52,009 INFO L462 AbstractCegarLoop]: Abstraction has 21745 states and 67061 transitions. [2019-12-27 02:45:52,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 02:45:52,009 INFO L276 IsEmpty]: Start isEmpty. Operand 21745 states and 67061 transitions. [2019-12-27 02:45:52,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:45:52,031 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:45:52,031 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:45:52,031 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:45:52,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:45:52,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1421968206, now seen corresponding path program 2 times [2019-12-27 02:45:52,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:45:52,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530366479] [2019-12-27 02:45:52,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:45:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:45:52,286 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 02:45:52,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530366479] [2019-12-27 02:45:52,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:45:52,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:45:52,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694269419] [2019-12-27 02:45:52,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 02:45:52,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:45:52,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 02:45:52,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:45:52,296 INFO L87 Difference]: Start difference. First operand 21745 states and 67061 transitions. Second operand 10 states. [2019-12-27 02:45:54,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:45:54,104 INFO L93 Difference]: Finished difference Result 37884 states and 115944 transitions. [2019-12-27 02:45:54,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 02:45:54,105 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 02:45:54,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:45:54,150 INFO L225 Difference]: With dead ends: 37884 [2019-12-27 02:45:54,150 INFO L226 Difference]: Without dead ends: 31924 [2019-12-27 02:45:54,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-27 02:45:54,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31924 states. [2019-12-27 02:45:54,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31924 to 22197. [2019-12-27 02:45:54,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22197 states. [2019-12-27 02:45:54,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22197 states to 22197 states and 68309 transitions. [2019-12-27 02:45:54,578 INFO L78 Accepts]: Start accepts. Automaton has 22197 states and 68309 transitions. Word has length 66 [2019-12-27 02:45:54,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:45:54,579 INFO L462 AbstractCegarLoop]: Abstraction has 22197 states and 68309 transitions. [2019-12-27 02:45:54,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 02:45:54,579 INFO L276 IsEmpty]: Start isEmpty. Operand 22197 states and 68309 transitions. [2019-12-27 02:45:54,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:45:54,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:45:54,609 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:45:54,609 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:45:54,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:45:54,610 INFO L82 PathProgramCache]: Analyzing trace with hash 765284024, now seen corresponding path program 3 times [2019-12-27 02:45:54,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:45:54,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996497158] [2019-12-27 02:45:54,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:45:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:45:55,126 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 02:45:55,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996497158] [2019-12-27 02:45:55,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:45:55,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:45:55,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495755357] [2019-12-27 02:45:55,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:45:55,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:45:55,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:45:55,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:45:55,128 INFO L87 Difference]: Start difference. First operand 22197 states and 68309 transitions. Second operand 11 states. [2019-12-27 02:45:57,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:45:57,035 INFO L93 Difference]: Finished difference Result 34983 states and 107283 transitions. [2019-12-27 02:45:57,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 02:45:57,035 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 02:45:57,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:45:57,083 INFO L225 Difference]: With dead ends: 34983 [2019-12-27 02:45:57,083 INFO L226 Difference]: Without dead ends: 31500 [2019-12-27 02:45:57,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-12-27 02:45:57,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31500 states. [2019-12-27 02:45:57,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31500 to 21765. [2019-12-27 02:45:57,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21765 states. [2019-12-27 02:45:57,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21765 states to 21765 states and 66977 transitions. [2019-12-27 02:45:57,520 INFO L78 Accepts]: Start accepts. Automaton has 21765 states and 66977 transitions. Word has length 66 [2019-12-27 02:45:57,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:45:57,520 INFO L462 AbstractCegarLoop]: Abstraction has 21765 states and 66977 transitions. [2019-12-27 02:45:57,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:45:57,520 INFO L276 IsEmpty]: Start isEmpty. Operand 21765 states and 66977 transitions. [2019-12-27 02:45:57,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:45:57,548 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:45:57,548 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:45:57,548 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:45:57,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:45:57,549 INFO L82 PathProgramCache]: Analyzing trace with hash 53330666, now seen corresponding path program 4 times [2019-12-27 02:45:57,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:45:57,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604298874] [2019-12-27 02:45:57,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:45:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:45:57,977 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 02:45:57,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604298874] [2019-12-27 02:45:57,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:45:57,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 02:45:57,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774864133] [2019-12-27 02:45:57,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 02:45:57,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:45:57,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 02:45:57,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-27 02:45:57,979 INFO L87 Difference]: Start difference. First operand 21765 states and 66977 transitions. Second operand 13 states. [2019-12-27 02:46:03,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:03,413 INFO L93 Difference]: Finished difference Result 40633 states and 121826 transitions. [2019-12-27 02:46:03,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-27 02:46:03,413 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-27 02:46:03,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:03,464 INFO L225 Difference]: With dead ends: 40633 [2019-12-27 02:46:03,464 INFO L226 Difference]: Without dead ends: 40369 [2019-12-27 02:46:03,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=462, Invalid=2190, Unknown=0, NotChecked=0, Total=2652 [2019-12-27 02:46:03,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40369 states. [2019-12-27 02:46:03,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40369 to 29749. [2019-12-27 02:46:03,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29749 states. [2019-12-27 02:46:04,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29749 states to 29749 states and 90836 transitions. [2019-12-27 02:46:04,018 INFO L78 Accepts]: Start accepts. Automaton has 29749 states and 90836 transitions. Word has length 66 [2019-12-27 02:46:04,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:04,019 INFO L462 AbstractCegarLoop]: Abstraction has 29749 states and 90836 transitions. [2019-12-27 02:46:04,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 02:46:04,019 INFO L276 IsEmpty]: Start isEmpty. Operand 29749 states and 90836 transitions. [2019-12-27 02:46:04,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:46:04,052 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:04,053 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:46:04,053 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:46:04,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:04,053 INFO L82 PathProgramCache]: Analyzing trace with hash 955213646, now seen corresponding path program 5 times [2019-12-27 02:46:04,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:04,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821096714] [2019-12-27 02:46:04,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:04,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:04,157 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 02:46:04,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821096714] [2019-12-27 02:46:04,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:04,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:46:04,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179110249] [2019-12-27 02:46:04,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 02:46:04,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:04,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 02:46:04,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:46:04,160 INFO L87 Difference]: Start difference. First operand 29749 states and 90836 transitions. Second operand 8 states. [2019-12-27 02:46:06,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:06,477 INFO L93 Difference]: Finished difference Result 39654 states and 118795 transitions. [2019-12-27 02:46:06,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 02:46:06,478 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-27 02:46:06,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:06,533 INFO L225 Difference]: With dead ends: 39654 [2019-12-27 02:46:06,533 INFO L226 Difference]: Without dead ends: 39526 [2019-12-27 02:46:06,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2019-12-27 02:46:06,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39526 states. [2019-12-27 02:46:07,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39526 to 31410. [2019-12-27 02:46:07,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31410 states. [2019-12-27 02:46:07,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31410 states to 31410 states and 95498 transitions. [2019-12-27 02:46:07,088 INFO L78 Accepts]: Start accepts. Automaton has 31410 states and 95498 transitions. Word has length 66 [2019-12-27 02:46:07,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:07,088 INFO L462 AbstractCegarLoop]: Abstraction has 31410 states and 95498 transitions. [2019-12-27 02:46:07,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 02:46:07,088 INFO L276 IsEmpty]: Start isEmpty. Operand 31410 states and 95498 transitions. [2019-12-27 02:46:07,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:46:07,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:07,121 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:46:07,121 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:46:07,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:07,121 INFO L82 PathProgramCache]: Analyzing trace with hash 982883956, now seen corresponding path program 6 times [2019-12-27 02:46:07,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:07,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719406892] [2019-12-27 02:46:07,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:07,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:07,317 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 02:46:07,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719406892] [2019-12-27 02:46:07,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:07,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:46:07,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125641211] [2019-12-27 02:46:07,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:46:07,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:07,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:46:07,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:46:07,319 INFO L87 Difference]: Start difference. First operand 31410 states and 95498 transitions. Second operand 11 states. [2019-12-27 02:46:09,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:09,575 INFO L93 Difference]: Finished difference Result 44634 states and 136321 transitions. [2019-12-27 02:46:09,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 02:46:09,576 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 02:46:09,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:09,638 INFO L225 Difference]: With dead ends: 44634 [2019-12-27 02:46:09,638 INFO L226 Difference]: Without dead ends: 41103 [2019-12-27 02:46:09,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2019-12-27 02:46:09,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41103 states. [2019-12-27 02:46:10,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41103 to 32658. [2019-12-27 02:46:10,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32658 states. [2019-12-27 02:46:10,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32658 states to 32658 states and 99058 transitions. [2019-12-27 02:46:10,212 INFO L78 Accepts]: Start accepts. Automaton has 32658 states and 99058 transitions. Word has length 66 [2019-12-27 02:46:10,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:10,212 INFO L462 AbstractCegarLoop]: Abstraction has 32658 states and 99058 transitions. [2019-12-27 02:46:10,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:46:10,212 INFO L276 IsEmpty]: Start isEmpty. Operand 32658 states and 99058 transitions. [2019-12-27 02:46:10,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:46:10,247 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:10,247 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:46:10,247 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:46:10,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:10,248 INFO L82 PathProgramCache]: Analyzing trace with hash -65894480, now seen corresponding path program 7 times [2019-12-27 02:46:10,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:10,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127868595] [2019-12-27 02:46:10,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:10,312 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 02:46:10,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127868595] [2019-12-27 02:46:10,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:10,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:46:10,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113262622] [2019-12-27 02:46:10,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:46:10,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:10,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:46:10,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:46:10,314 INFO L87 Difference]: Start difference. First operand 32658 states and 99058 transitions. Second operand 3 states. [2019-12-27 02:46:10,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:10,450 INFO L93 Difference]: Finished difference Result 32658 states and 99057 transitions. [2019-12-27 02:46:10,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:46:10,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 02:46:10,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:10,515 INFO L225 Difference]: With dead ends: 32658 [2019-12-27 02:46:10,515 INFO L226 Difference]: Without dead ends: 32658 [2019-12-27 02:46:10,515 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 02:46:10,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32658 states. [2019-12-27 02:46:10,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32658 to 23091. [2019-12-27 02:46:10,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23091 states. [2019-12-27 02:46:10,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23091 states to 23091 states and 71274 transitions. [2019-12-27 02:46:10,988 INFO L78 Accepts]: Start accepts. Automaton has 23091 states and 71274 transitions. Word has length 66 [2019-12-27 02:46:10,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:10,988 INFO L462 AbstractCegarLoop]: Abstraction has 23091 states and 71274 transitions. [2019-12-27 02:46:10,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:46:10,988 INFO L276 IsEmpty]: Start isEmpty. Operand 23091 states and 71274 transitions. [2019-12-27 02:46:11,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:46:11,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:11,018 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:46:11,018 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:46:11,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:11,019 INFO L82 PathProgramCache]: Analyzing trace with hash -51721250, now seen corresponding path program 1 times [2019-12-27 02:46:11,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:11,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026949892] [2019-12-27 02:46:11,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:11,196 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 02:46:11,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026949892] [2019-12-27 02:46:11,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:11,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:46:11,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227807891] [2019-12-27 02:46:11,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:46:11,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:11,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:46:11,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:46:11,198 INFO L87 Difference]: Start difference. First operand 23091 states and 71274 transitions. Second operand 11 states. [2019-12-27 02:46:13,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:13,531 INFO L93 Difference]: Finished difference Result 34081 states and 105055 transitions. [2019-12-27 02:46:13,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 02:46:13,531 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 02:46:13,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:13,578 INFO L225 Difference]: With dead ends: 34081 [2019-12-27 02:46:13,578 INFO L226 Difference]: Without dead ends: 31326 [2019-12-27 02:46:13,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-27 02:46:13,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31326 states. [2019-12-27 02:46:13,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31326 to 22401. [2019-12-27 02:46:13,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22401 states. [2019-12-27 02:46:14,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22401 states to 22401 states and 69174 transitions. [2019-12-27 02:46:14,004 INFO L78 Accepts]: Start accepts. Automaton has 22401 states and 69174 transitions. Word has length 67 [2019-12-27 02:46:14,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:14,004 INFO L462 AbstractCegarLoop]: Abstraction has 22401 states and 69174 transitions. [2019-12-27 02:46:14,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:46:14,004 INFO L276 IsEmpty]: Start isEmpty. Operand 22401 states and 69174 transitions. [2019-12-27 02:46:14,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:46:14,031 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:14,031 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:46:14,031 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:46:14,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:14,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1803113718, now seen corresponding path program 2 times [2019-12-27 02:46:14,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:14,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734578296] [2019-12-27 02:46:14,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:14,200 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 02:46:14,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734578296] [2019-12-27 02:46:14,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:14,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 02:46:14,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575180060] [2019-12-27 02:46:14,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 02:46:14,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:14,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 02:46:14,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 02:46:14,202 INFO L87 Difference]: Start difference. First operand 22401 states and 69174 transitions. Second operand 12 states. [2019-12-27 02:46:16,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:16,347 INFO L93 Difference]: Finished difference Result 33238 states and 102430 transitions. [2019-12-27 02:46:16,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 02:46:16,347 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 02:46:16,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:16,397 INFO L225 Difference]: With dead ends: 33238 [2019-12-27 02:46:16,397 INFO L226 Difference]: Without dead ends: 31902 [2019-12-27 02:46:16,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-12-27 02:46:16,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31902 states. [2019-12-27 02:46:16,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31902 to 22233. [2019-12-27 02:46:16,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22233 states. [2019-12-27 02:46:16,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22233 states to 22233 states and 68724 transitions. [2019-12-27 02:46:16,836 INFO L78 Accepts]: Start accepts. Automaton has 22233 states and 68724 transitions. Word has length 67 [2019-12-27 02:46:16,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:16,836 INFO L462 AbstractCegarLoop]: Abstraction has 22233 states and 68724 transitions. [2019-12-27 02:46:16,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 02:46:16,836 INFO L276 IsEmpty]: Start isEmpty. Operand 22233 states and 68724 transitions. [2019-12-27 02:46:16,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:46:16,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:16,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:46:16,863 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:46:16,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:16,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1857250972, now seen corresponding path program 3 times [2019-12-27 02:46:16,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:16,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618727468] [2019-12-27 02:46:16,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:16,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:17,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:46:17,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618727468] [2019-12-27 02:46:17,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:17,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 02:46:17,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756067189] [2019-12-27 02:46:17,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 02:46:17,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:17,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 02:46:17,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-12-27 02:46:17,524 INFO L87 Difference]: Start difference. First operand 22233 states and 68724 transitions. Second operand 19 states. [2019-12-27 02:46:27,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:27,444 INFO L93 Difference]: Finished difference Result 38065 states and 117368 transitions. [2019-12-27 02:46:27,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-12-27 02:46:27,445 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-12-27 02:46:27,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:27,500 INFO L225 Difference]: With dead ends: 38065 [2019-12-27 02:46:27,501 INFO L226 Difference]: Without dead ends: 37061 [2019-12-27 02:46:27,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=574, Invalid=3848, Unknown=0, NotChecked=0, Total=4422 [2019-12-27 02:46:27,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37061 states. [2019-12-27 02:46:27,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37061 to 24675. [2019-12-27 02:46:27,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24675 states. [2019-12-27 02:46:27,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24675 states to 24675 states and 76045 transitions. [2019-12-27 02:46:27,984 INFO L78 Accepts]: Start accepts. Automaton has 24675 states and 76045 transitions. Word has length 67 [2019-12-27 02:46:27,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:27,984 INFO L462 AbstractCegarLoop]: Abstraction has 24675 states and 76045 transitions. [2019-12-27 02:46:27,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 02:46:27,985 INFO L276 IsEmpty]: Start isEmpty. Operand 24675 states and 76045 transitions. [2019-12-27 02:46:28,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:46:28,011 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:28,011 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:46:28,011 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:46:28,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:28,011 INFO L82 PathProgramCache]: Analyzing trace with hash 2040469818, now seen corresponding path program 4 times [2019-12-27 02:46:28,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:28,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528261601] [2019-12-27 02:46:28,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:29,128 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 02:46:29,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528261601] [2019-12-27 02:46:29,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:29,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-27 02:46:29,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189565098] [2019-12-27 02:46:29,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 02:46:29,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:29,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 02:46:29,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-12-27 02:46:29,130 INFO L87 Difference]: Start difference. First operand 24675 states and 76045 transitions. Second operand 21 states. [2019-12-27 02:46:41,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:41,280 INFO L93 Difference]: Finished difference Result 37014 states and 112831 transitions. [2019-12-27 02:46:41,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-12-27 02:46:41,281 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2019-12-27 02:46:41,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:41,331 INFO L225 Difference]: With dead ends: 37014 [2019-12-27 02:46:41,331 INFO L226 Difference]: Without dead ends: 35425 [2019-12-27 02:46:41,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1440 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=689, Invalid=5163, Unknown=0, NotChecked=0, Total=5852 [2019-12-27 02:46:41,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35425 states. [2019-12-27 02:46:41,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35425 to 25002. [2019-12-27 02:46:41,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25002 states. [2019-12-27 02:46:41,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25002 states to 25002 states and 76856 transitions. [2019-12-27 02:46:41,808 INFO L78 Accepts]: Start accepts. Automaton has 25002 states and 76856 transitions. Word has length 67 [2019-12-27 02:46:41,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:41,808 INFO L462 AbstractCegarLoop]: Abstraction has 25002 states and 76856 transitions. [2019-12-27 02:46:41,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 02:46:41,808 INFO L276 IsEmpty]: Start isEmpty. Operand 25002 states and 76856 transitions. [2019-12-27 02:46:41,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:46:41,838 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:41,838 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:46:41,839 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:46:41,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:41,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1956516202, now seen corresponding path program 5 times [2019-12-27 02:46:41,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:41,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605853662] [2019-12-27 02:46:41,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:42,282 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 02:46:42,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605853662] [2019-12-27 02:46:42,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:42,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 02:46:42,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518419464] [2019-12-27 02:46:42,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 02:46:42,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:42,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 02:46:42,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2019-12-27 02:46:42,284 INFO L87 Difference]: Start difference. First operand 25002 states and 76856 transitions. Second operand 19 states. [2019-12-27 02:46:51,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:51,632 INFO L93 Difference]: Finished difference Result 44769 states and 133235 transitions. [2019-12-27 02:46:51,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-12-27 02:46:51,632 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-12-27 02:46:51,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:51,685 INFO L225 Difference]: With dead ends: 44769 [2019-12-27 02:46:51,686 INFO L226 Difference]: Without dead ends: 39590 [2019-12-27 02:46:51,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1636 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=837, Invalid=4713, Unknown=0, NotChecked=0, Total=5550 [2019-12-27 02:46:51,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39590 states. [2019-12-27 02:46:52,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39590 to 23065. [2019-12-27 02:46:52,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23065 states. [2019-12-27 02:46:52,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23065 states to 23065 states and 70809 transitions. [2019-12-27 02:46:52,175 INFO L78 Accepts]: Start accepts. Automaton has 23065 states and 70809 transitions. Word has length 67 [2019-12-27 02:46:52,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:52,175 INFO L462 AbstractCegarLoop]: Abstraction has 23065 states and 70809 transitions. [2019-12-27 02:46:52,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 02:46:52,175 INFO L276 IsEmpty]: Start isEmpty. Operand 23065 states and 70809 transitions. [2019-12-27 02:46:52,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:46:52,203 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:52,203 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:46:52,203 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:46:52,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:52,203 INFO L82 PathProgramCache]: Analyzing trace with hash -471224516, now seen corresponding path program 6 times [2019-12-27 02:46:52,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:52,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377952971] [2019-12-27 02:46:52,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:52,383 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 02:46:52,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377952971] [2019-12-27 02:46:52,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:52,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 02:46:52,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065256267] [2019-12-27 02:46:52,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 02:46:52,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:52,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 02:46:52,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 02:46:52,387 INFO L87 Difference]: Start difference. First operand 23065 states and 70809 transitions. Second operand 12 states. [2019-12-27 02:46:55,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:55,377 INFO L93 Difference]: Finished difference Result 39246 states and 119095 transitions. [2019-12-27 02:46:55,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 02:46:55,377 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 02:46:55,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:55,433 INFO L225 Difference]: With dead ends: 39246 [2019-12-27 02:46:55,433 INFO L226 Difference]: Without dead ends: 34710 [2019-12-27 02:46:55,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2019-12-27 02:46:55,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34710 states. [2019-12-27 02:46:55,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34710 to 22608. [2019-12-27 02:46:55,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22608 states. [2019-12-27 02:46:55,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22608 states to 22608 states and 69466 transitions. [2019-12-27 02:46:55,911 INFO L78 Accepts]: Start accepts. Automaton has 22608 states and 69466 transitions. Word has length 67 [2019-12-27 02:46:55,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:55,911 INFO L462 AbstractCegarLoop]: Abstraction has 22608 states and 69466 transitions. [2019-12-27 02:46:55,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 02:46:55,911 INFO L276 IsEmpty]: Start isEmpty. Operand 22608 states and 69466 transitions. [2019-12-27 02:46:55,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:46:55,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:55,934 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:46:55,934 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:46:55,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:55,934 INFO L82 PathProgramCache]: Analyzing trace with hash -715209700, now seen corresponding path program 7 times [2019-12-27 02:46:55,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:55,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247182648] [2019-12-27 02:46:55,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:55,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:56,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:46:56,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247182648] [2019-12-27 02:46:56,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:56,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 02:46:56,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691269689] [2019-12-27 02:46:56,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 02:46:56,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:56,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 02:46:56,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 02:46:56,121 INFO L87 Difference]: Start difference. First operand 22608 states and 69466 transitions. Second operand 12 states. [2019-12-27 02:46:58,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:58,827 INFO L93 Difference]: Finished difference Result 36778 states and 112075 transitions. [2019-12-27 02:46:58,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 02:46:58,828 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 02:46:58,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:58,877 INFO L225 Difference]: With dead ends: 36778 [2019-12-27 02:46:58,877 INFO L226 Difference]: Without dead ends: 34025 [2019-12-27 02:46:58,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=926, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 02:46:58,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34025 states. [2019-12-27 02:46:59,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34025 to 21926. [2019-12-27 02:46:59,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21926 states. [2019-12-27 02:46:59,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21926 states to 21926 states and 67566 transitions. [2019-12-27 02:46:59,293 INFO L78 Accepts]: Start accepts. Automaton has 21926 states and 67566 transitions. Word has length 67 [2019-12-27 02:46:59,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:59,293 INFO L462 AbstractCegarLoop]: Abstraction has 21926 states and 67566 transitions. [2019-12-27 02:46:59,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 02:46:59,293 INFO L276 IsEmpty]: Start isEmpty. Operand 21926 states and 67566 transitions. [2019-12-27 02:46:59,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:46:59,316 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:59,316 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:46:59,316 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:46:59,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:59,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1154306208, now seen corresponding path program 8 times [2019-12-27 02:46:59,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:59,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573274757] [2019-12-27 02:46:59,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:59,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:46:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:46:59,449 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:46:59,449 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:46:59,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~z$flush_delayed~0_27) (= 0 v_~x~0_129) (= 0 v_~__unbuffered_p1_EAX~0_44) (= v_~weak$$choice2~0_125 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd1~0_274 0) (= |v_#NULL.offset_7| 0) (= v_~z$mem_tmp~0_16 0) (= v_~z$r_buff1_thd0~0_203 0) (= v_~main$tmp_guard1~0_48 0) (= 0 v_~z$r_buff0_thd3~0_416) (= v_~z$w_buff1_used~0_618 0) (< 0 |v_#StackHeapBarrier_17|) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1300~0.base_23|) (= 0 v_~__unbuffered_p2_EAX~0_39) (= v_~z$r_buff0_thd0~0_208 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$w_buff1~0_350 0) (= v_~z$w_buff0_used~0_900 0) (= 0 v_~__unbuffered_p0_EAX~0_137) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1300~0.base_23| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1300~0.base_23|) |v_ULTIMATE.start_main_~#t1300~0.offset_17| 0)) |v_#memory_int_17|) (= v_~z$read_delayed~0_7 0) (= |v_#valid_60| (store .cse0 |v_ULTIMATE.start_main_~#t1300~0.base_23| 1)) (= v_~z$r_buff1_thd2~0_170 0) (= 0 |v_#NULL.base_7|) (= 0 v_~z$r_buff1_thd3~0_300) (= (select .cse0 |v_ULTIMATE.start_main_~#t1300~0.base_23|) 0) (= v_~z$r_buff1_thd1~0_166 0) (= 0 |v_ULTIMATE.start_main_~#t1300~0.offset_17|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1300~0.base_23| 4)) (= v_~z$w_buff0~0_454 0) (= 0 v_~weak$$choice0~0_13) (= v_~z~0_160 0) (= v_~main$tmp_guard0~0_24 0) (= 0 v_~__unbuffered_cnt~0_97) (= v_~z$r_buff0_thd2~0_191 0) (= v_~y~0_31 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_170, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, ULTIMATE.start_main_~#t1301~0.offset=|v_ULTIMATE.start_main_~#t1301~0.offset_12|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_69|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_175|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_81|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_208, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_137, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_39, ULTIMATE.start_main_~#t1302~0.base=|v_ULTIMATE.start_main_~#t1302~0.base_17|, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_618, ~z$flush_delayed~0=v_~z$flush_delayed~0_27, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_166, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_416, ULTIMATE.start_main_~#t1301~0.base=|v_ULTIMATE.start_main_~#t1301~0.base_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ~x~0=v_~x~0_129, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_350, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_37|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t1300~0.base=|v_ULTIMATE.start_main_~#t1300~0.base_23|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_52|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_203, ULTIMATE.start_main_~#t1300~0.offset=|v_ULTIMATE.start_main_~#t1300~0.offset_17|, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_191, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_900, ~z$w_buff0~0=v_~z$w_buff0~0_454, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_300, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1302~0.offset=|v_ULTIMATE.start_main_~#t1302~0.offset_14|, ~z~0=v_~z~0_160, ~weak$$choice2~0=v_~weak$$choice2~0_125, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_274} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t1301~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1302~0.base, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t1301~0.base, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1300~0.base, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1300~0.offset, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1302~0.offset, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 02:46:59,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L822-1-->L824: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1301~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1301~0.offset_9|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1301~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1301~0.base_11|) |v_ULTIMATE.start_main_~#t1301~0.offset_9| 1)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1301~0.base_11|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1301~0.base_11|)) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1301~0.base_11| 1) |v_#valid_38|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1301~0.base_11| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_6|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1301~0.offset=|v_ULTIMATE.start_main_~#t1301~0.offset_9|, ULTIMATE.start_main_~#t1301~0.base=|v_ULTIMATE.start_main_~#t1301~0.base_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t1301~0.offset, ULTIMATE.start_main_~#t1301~0.base, #length] because there is no mapped edge [2019-12-27 02:46:59,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L4-->L746: Formula: (and (= v_~z$r_buff0_thd2~0_29 v_~z$r_buff1_thd2~0_21) (= v_~__unbuffered_p0_EAX~0_8 v_~x~0_8) (= v_~z$r_buff0_thd0~0_28 v_~z$r_buff1_thd0~0_16) (= v_~z$r_buff0_thd1~0_26 1) (= v_~z$r_buff0_thd1~0_27 v_~z$r_buff1_thd1~0_15) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20 0)) (= v_~z$r_buff0_thd3~0_67 v_~z$r_buff1_thd3~0_43)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_26, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 02:46:59,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-2-->L766-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In-569473029 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-569473029 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out-569473029| ~z$w_buff1~0_In-569473029) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out-569473029| ~z~0_In-569473029)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-569473029, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-569473029, ~z$w_buff1~0=~z$w_buff1~0_In-569473029, ~z~0=~z~0_In-569473029} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-569473029|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-569473029, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-569473029, ~z$w_buff1~0=~z$w_buff1~0_In-569473029, ~z~0=~z~0_In-569473029} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 02:46:59,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L766-4-->L767: Formula: (= v_~z~0_16 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-27 02:46:59,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L824-1-->L826: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1302~0.offset_11|) (not (= |v_ULTIMATE.start_main_~#t1302~0.base_13| 0)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1302~0.base_13|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1302~0.base_13|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1302~0.base_13| 1)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1302~0.base_13| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1302~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1302~0.base_13|) |v_ULTIMATE.start_main_~#t1302~0.offset_11| 2)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1302~0.offset=|v_ULTIMATE.start_main_~#t1302~0.offset_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1302~0.base=|v_ULTIMATE.start_main_~#t1302~0.base_13|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t1302~0.offset, #length, ULTIMATE.start_main_~#t1302~0.base] because there is no mapped edge [2019-12-27 02:46:59,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In345113862 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In345113862 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out345113862| 0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out345113862| ~z$w_buff0_used~0_In345113862) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In345113862, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In345113862} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In345113862, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out345113862|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In345113862} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 02:46:59,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L768-->L768-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In1009272203 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In1009272203 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In1009272203 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1009272203 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1009272203 |P1Thread1of1ForFork2_#t~ite12_Out1009272203|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out1009272203|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1009272203, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1009272203, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1009272203, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1009272203} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1009272203, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1009272203, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1009272203, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1009272203|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1009272203} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 02:46:59,462 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L769-->L769-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In724936625 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In724936625 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In724936625 |P1Thread1of1ForFork2_#t~ite13_Out724936625|)) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out724936625| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In724936625, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In724936625} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In724936625, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out724936625|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In724936625} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 02:46:59,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L790-->L790-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-415302333 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite27_Out-415302333| ~z$w_buff0_used~0_In-415302333) (= |P2Thread1of1ForFork0_#t~ite26_In-415302333| |P2Thread1of1ForFork0_#t~ite26_Out-415302333|) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite26_Out-415302333| ~z$w_buff0_used~0_In-415302333) (= |P2Thread1of1ForFork0_#t~ite26_Out-415302333| |P2Thread1of1ForFork0_#t~ite27_Out-415302333|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-415302333 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In-415302333 256)) .cse1) (and (= 0 (mod ~z$r_buff1_thd3~0_In-415302333 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-415302333 256))))))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-415302333|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-415302333, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-415302333, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-415302333, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-415302333, ~weak$$choice2~0=~weak$$choice2~0_In-415302333} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-415302333|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-415302333|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-415302333, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-415302333, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-415302333, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-415302333, ~weak$$choice2~0=~weak$$choice2~0_In-415302333} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 02:46:59,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L792-->L793: Formula: (and (= v_~z$r_buff0_thd3~0_99 v_~z$r_buff0_thd3~0_100) (not (= 0 (mod v_~weak$$choice2~0_30 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_30} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 02:46:59,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In432206974 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In432206974 256) 0))) (or (and (= ~z$w_buff0_used~0_In432206974 |P0Thread1of1ForFork1_#t~ite5_Out432206974|) (or .cse0 .cse1)) (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out432206974| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In432206974, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In432206974} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out432206974|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In432206974, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In432206974} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 02:46:59,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L795-->L799: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_50 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_50} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 02:46:59,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L799-2-->L799-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1004103431 256))) (.cse2 (= |P2Thread1of1ForFork0_#t~ite39_Out-1004103431| |P2Thread1of1ForFork0_#t~ite38_Out-1004103431|)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1004103431 256)))) (or (and (or .cse0 .cse1) .cse2 (= |P2Thread1of1ForFork0_#t~ite38_Out-1004103431| ~z~0_In-1004103431)) (and (not .cse1) .cse2 (= |P2Thread1of1ForFork0_#t~ite38_Out-1004103431| ~z$w_buff1~0_In-1004103431) (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1004103431, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1004103431, ~z$w_buff1~0=~z$w_buff1~0_In-1004103431, ~z~0=~z~0_In-1004103431} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-1004103431|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-1004103431|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1004103431, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1004103431, ~z$w_buff1~0=~z$w_buff1~0_In-1004103431, ~z~0=~z~0_In-1004103431} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 02:46:59,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-452276678 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-452276678 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-452276678 |P2Thread1of1ForFork0_#t~ite40_Out-452276678|)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-452276678|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-452276678, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-452276678} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-452276678, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-452276678|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-452276678} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 02:46:59,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In715836979 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In715836979 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In715836979 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In715836979 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite41_Out715836979| ~z$w_buff1_used~0_In715836979)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite41_Out715836979| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In715836979, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In715836979, ~z$w_buff1_used~0=~z$w_buff1_used~0_In715836979, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In715836979} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In715836979, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In715836979, ~z$w_buff1_used~0=~z$w_buff1_used~0_In715836979, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In715836979, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out715836979|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 02:46:59,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L802-->L802-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1050771076 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1050771076 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out-1050771076| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out-1050771076| ~z$r_buff0_thd3~0_In-1050771076) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1050771076, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1050771076} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1050771076, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1050771076, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1050771076|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 02:46:59,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1244534672 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1244534672 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In-1244534672 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1244534672 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-1244534672|)) (and (or .cse1 .cse0) (= ~z$r_buff1_thd3~0_In-1244534672 |P2Thread1of1ForFork0_#t~ite43_Out-1244534672|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1244534672, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1244534672, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1244534672, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1244534672} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1244534672|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1244534672, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1244534672, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1244534672, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1244534672} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 02:46:59,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_143 |v_P2Thread1of1ForFork0_#t~ite43_30|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_29|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 02:46:59,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L748-->L748-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1739072074 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-1739072074 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd1~0_In-1739072074 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1739072074 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out-1739072074| ~z$w_buff1_used~0_In-1739072074) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite6_Out-1739072074| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1739072074, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1739072074, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1739072074, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1739072074} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1739072074, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1739072074|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1739072074, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1739072074, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1739072074} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 02:46:59,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L749-->L750: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-295893259 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-295893259 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In-295893259 ~z$r_buff0_thd1~0_Out-295893259)) (and (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out-295893259) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-295893259, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-295893259} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-295893259, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-295893259|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-295893259} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 02:46:59,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L750-->L750-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1435296545 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1435296545 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1435296545 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In-1435296545 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite8_Out-1435296545| ~z$r_buff1_thd1~0_In-1435296545) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite8_Out-1435296545| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1435296545, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1435296545, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1435296545, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1435296545} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1435296545|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1435296545, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1435296545, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1435296545, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1435296545} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 02:46:59,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_100 |v_P0Thread1of1ForFork1_#t~ite8_44|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_67 1) v_~__unbuffered_cnt~0_66) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_43|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_100, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 02:46:59,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L770-->L770-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-106298085 256))) (.cse2 (= (mod ~z$r_buff1_thd2~0_In-106298085 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-106298085 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-106298085 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In-106298085 |P1Thread1of1ForFork2_#t~ite14_Out-106298085|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-106298085|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-106298085, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-106298085, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-106298085, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-106298085} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-106298085, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-106298085, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-106298085, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-106298085|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-106298085} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 02:46:59,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L770-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_120 |v_P1Thread1of1ForFork2_#t~ite14_34|) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= v_~__unbuffered_cnt~0_76 (+ v_~__unbuffered_cnt~0_77 1)) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_34|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_33|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 02:46:59,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L826-1-->L832: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 02:46:59,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-2-->L832-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite48_Out665518673| |ULTIMATE.start_main_#t~ite47_Out665518673|)) (.cse1 (= (mod ~z$w_buff1_used~0_In665518673 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In665518673 256)))) (or (and .cse0 (= ~z$w_buff1~0_In665518673 |ULTIMATE.start_main_#t~ite47_Out665518673|) (not .cse1) (not .cse2)) (and .cse0 (or .cse1 .cse2) (= ~z~0_In665518673 |ULTIMATE.start_main_#t~ite47_Out665518673|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In665518673, ~z$w_buff1_used~0=~z$w_buff1_used~0_In665518673, ~z$w_buff1~0=~z$w_buff1~0_In665518673, ~z~0=~z~0_In665518673} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In665518673, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out665518673|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In665518673, ~z$w_buff1~0=~z$w_buff1~0_In665518673, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out665518673|, ~z~0=~z~0_In665518673} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 02:46:59,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L833-->L833-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In652403206 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In652403206 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out652403206| 0)) (and (= ~z$w_buff0_used~0_In652403206 |ULTIMATE.start_main_#t~ite49_Out652403206|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In652403206, ~z$w_buff0_used~0=~z$w_buff0_used~0_In652403206} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In652403206, ~z$w_buff0_used~0=~z$w_buff0_used~0_In652403206, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out652403206|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 02:46:59,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L834-->L834-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-884367973 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-884367973 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-884367973 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-884367973 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-884367973 |ULTIMATE.start_main_#t~ite50_Out-884367973|)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-884367973|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-884367973, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-884367973, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-884367973, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-884367973} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-884367973|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-884367973, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-884367973, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-884367973, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-884367973} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 02:46:59,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L835-->L835-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1108306445 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1108306445 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out1108306445|) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In1108306445 |ULTIMATE.start_main_#t~ite51_Out1108306445|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1108306445, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1108306445} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1108306445, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1108306445|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1108306445} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 02:46:59,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L836-->L836-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In-635839008 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-635839008 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-635839008 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-635839008 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite52_Out-635839008|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$r_buff1_thd0~0_In-635839008 |ULTIMATE.start_main_#t~ite52_Out-635839008|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-635839008, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-635839008, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-635839008, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-635839008} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-635839008|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-635839008, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-635839008, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-635839008, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-635839008} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 02:46:59,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p1_EAX~0_25) (= v_~main$tmp_guard1~0_20 0) (= 0 v_~__unbuffered_p0_EAX~0_99) (= 0 v_~__unbuffered_p2_EAX~0_26) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_143 |v_ULTIMATE.start_main_#t~ite52_43|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_42|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_143, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:46:59,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:46:59 BasicIcfg [2019-12-27 02:46:59,557 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:46:59,558 INFO L168 Benchmark]: Toolchain (without parser) took 158138.73 ms. Allocated memory was 138.4 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 100.3 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-27 02:46:59,559 INFO L168 Benchmark]: CDTParser took 0.43 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 02:46:59,560 INFO L168 Benchmark]: CACSL2BoogieTranslator took 862.64 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 100.1 MB in the beginning and 156.4 MB in the end (delta: -56.4 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:46:59,560 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.71 ms. Allocated memory is still 202.4 MB. Free memory was 156.4 MB in the beginning and 153.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 02:46:59,560 INFO L168 Benchmark]: Boogie Preprocessor took 74.56 ms. Allocated memory is still 202.4 MB. Free memory was 153.8 MB in the beginning and 151.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 02:46:59,561 INFO L168 Benchmark]: RCFGBuilder took 991.81 ms. Allocated memory is still 202.4 MB. Free memory was 151.2 MB in the beginning and 101.1 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. [2019-12-27 02:46:59,561 INFO L168 Benchmark]: TraceAbstraction took 156145.16 ms. Allocated memory was 202.4 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 100.4 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-27 02:46:59,564 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.43 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 862.64 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 100.1 MB in the beginning and 156.4 MB in the end (delta: -56.4 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.71 ms. Allocated memory is still 202.4 MB. Free memory was 156.4 MB in the beginning and 153.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 74.56 ms. Allocated memory is still 202.4 MB. Free memory was 153.8 MB in the beginning and 151.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 991.81 ms. Allocated memory is still 202.4 MB. Free memory was 151.2 MB in the beginning and 101.1 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 156145.16 ms. Allocated memory was 202.4 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 100.4 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 176 ProgramPointsBefore, 95 ProgramPointsAfterwards, 213 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 29 ChoiceCompositions, 7276 VarBasedMoverChecksPositive, 432 VarBasedMoverChecksNegative, 272 SemBasedMoverChecksPositive, 254 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.1s, 0 MoverChecksTotal, 130045 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t1300, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1301, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L826] FCALL, FORK 0 pthread_create(&t1302, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L800] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L801] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L802] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L833] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L834] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L835] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 155.8s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 76.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8957 SDtfs, 10511 SDslu, 42701 SDs, 0 SdLazy, 56022 SolverSat, 630 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 43.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 640 GetRequests, 58 SyntacticMatches, 26 SemanticMatches, 556 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5777 ImplicationChecksByTransitivity, 10.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158936occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 41.3s AutomataMinimizationTime, 30 MinimizatonAttempts, 283626 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 1590 NumberOfCodeBlocks, 1590 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1493 ConstructedInterpolants, 0 QuantifiedInterpolants, 427290 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...