/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/mix043_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:29:08,158 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:29:08,161 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:29:08,180 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:29:08,181 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:29:08,182 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:29:08,184 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:29:08,193 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:29:08,197 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:29:08,201 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:29:08,203 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:29:08,205 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:29:08,205 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:29:08,207 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:29:08,209 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:29:08,210 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:29:08,212 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:29:08,213 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:29:08,215 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:29:08,220 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:29:08,224 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:29:08,227 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:29:08,228 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:29:08,229 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:29:08,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:29:08,232 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:29:08,232 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:29:08,234 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:29:08,235 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:29:08,236 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:29:08,237 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:29:08,238 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:29:08,239 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:29:08,239 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:29:08,241 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:29:08,241 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:29:08,242 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:29:08,242 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:29:08,242 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:29:08,243 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:29:08,245 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:29:08,245 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-18 17:29:08,278 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:29:08,279 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:29:08,282 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:29:08,282 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:29:08,282 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:29:08,283 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:29:08,283 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:29:08,283 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:29:08,283 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:29:08,284 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:29:08,284 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:29:08,284 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:29:08,284 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:29:08,284 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:29:08,285 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:29:08,287 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:29:08,287 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:29:08,287 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:29:08,288 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:29:08,288 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:29:08,288 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:29:08,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:29:08,288 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:29:08,289 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:29:08,289 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:29:08,289 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:29:08,289 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:29:08,289 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:29:08,289 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:29:08,587 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:29:08,599 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:29:08,603 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:29:08,604 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:29:08,605 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:29:08,605 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043_tso.opt.i [2019-12-18 17:29:08,677 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05da0e89e/25bd6cc48a9a49d6aa4f36c4eb9a7d85/FLAGf5e8adc7c [2019-12-18 17:29:09,269 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:29:09,270 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043_tso.opt.i [2019-12-18 17:29:09,288 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05da0e89e/25bd6cc48a9a49d6aa4f36c4eb9a7d85/FLAGf5e8adc7c [2019-12-18 17:29:09,556 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05da0e89e/25bd6cc48a9a49d6aa4f36c4eb9a7d85 [2019-12-18 17:29:09,565 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:29:09,566 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:29:09,567 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:29:09,567 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:29:09,571 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:29:09,572 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:29:09" (1/1) ... [2019-12-18 17:29:09,575 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@408b5995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:29:09, skipping insertion in model container [2019-12-18 17:29:09,575 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:29:09" (1/1) ... [2019-12-18 17:29:09,582 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:29:09,632 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:29:10,159 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:29:10,171 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:29:10,281 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:29:10,375 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:29:10,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:29:10 WrapperNode [2019-12-18 17:29:10,376 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:29:10,377 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:29:10,377 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:29:10,377 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:29:10,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:29:10" (1/1) ... [2019-12-18 17:29:10,411 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:29:10" (1/1) ... [2019-12-18 17:29:10,447 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:29:10,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:29:10,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:29:10,448 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:29:10,458 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:29:10" (1/1) ... [2019-12-18 17:29:10,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:29:10" (1/1) ... [2019-12-18 17:29:10,463 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:29:10" (1/1) ... [2019-12-18 17:29:10,464 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:29:10" (1/1) ... [2019-12-18 17:29:10,475 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:29:10" (1/1) ... [2019-12-18 17:29:10,479 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:29:10" (1/1) ... [2019-12-18 17:29:10,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:29:10" (1/1) ... [2019-12-18 17:29:10,488 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:29:10,488 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:29:10,489 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:29:10,489 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:29:10,490 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:29:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:29:10,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:29:10,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:29:10,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:29:10,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:29:10,567 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:29:10,567 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:29:10,567 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:29:10,567 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:29:10,568 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:29:10,568 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:29:10,568 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 17:29:10,568 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 17:29:10,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:29:10,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:29:10,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:29:10,571 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 17:29:11,361 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:29:11,361 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:29:11,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:29:11 BoogieIcfgContainer [2019-12-18 17:29:11,363 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:29:11,365 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:29:11,365 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:29:11,369 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:29:11,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:29:09" (1/3) ... [2019-12-18 17:29:11,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aa2e7c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:29:11, skipping insertion in model container [2019-12-18 17:29:11,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:29:10" (2/3) ... [2019-12-18 17:29:11,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aa2e7c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:29:11, skipping insertion in model container [2019-12-18 17:29:11,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:29:11" (3/3) ... [2019-12-18 17:29:11,375 INFO L109 eAbstractionObserver]: Analyzing ICFG mix043_tso.opt.i [2019-12-18 17:29:11,385 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:29:11,385 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:29:11,395 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:29:11,397 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:29:11,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,436 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,436 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,438 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,438 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,440 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,440 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,464 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,465 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,465 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,465 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,465 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,465 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,466 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,466 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,466 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,467 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,467 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,467 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,467 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,467 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,468 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,468 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,468 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,468 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,468 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,469 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,469 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,469 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,469 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,469 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,470 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,470 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,470 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,470 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,470 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,471 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,471 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,471 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,471 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,472 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,476 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,476 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,478 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,479 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,482 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,482 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,485 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,485 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,486 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,486 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,486 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,486 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,486 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,487 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,487 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,487 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,487 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,487 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:11,502 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 17:29:11,522 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:29:11,522 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:29:11,523 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:29:11,523 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:29:11,523 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:29:11,523 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:29:11,523 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:29:11,523 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:29:11,540 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 210 transitions [2019-12-18 17:29:11,542 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-18 17:29:11,627 INFO L126 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-18 17:29:11,627 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:29:11,643 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 265 event pairs. 12/175 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 17:29:11,666 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-18 17:29:11,712 INFO L126 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-18 17:29:11,712 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:29:11,719 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 265 event pairs. 12/175 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 17:29:11,735 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-18 17:29:11,737 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:29:16,991 WARN L192 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-18 17:29:17,160 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-18 17:29:17,185 INFO L206 etLargeBlockEncoding]: Checked pairs total: 56592 [2019-12-18 17:29:17,185 INFO L214 etLargeBlockEncoding]: Total number of compositions: 126 [2019-12-18 17:29:17,189 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 97 transitions [2019-12-18 17:29:19,256 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 33838 states. [2019-12-18 17:29:19,258 INFO L276 IsEmpty]: Start isEmpty. Operand 33838 states. [2019-12-18 17:29:19,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 17:29:19,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:19,264 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:29:19,265 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:29:19,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:19,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1752766824, now seen corresponding path program 1 times [2019-12-18 17:29:19,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:19,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746066943] [2019-12-18 17:29:19,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:19,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:29:19,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746066943] [2019-12-18 17:29:19,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:19,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:29:19,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581225026] [2019-12-18 17:29:19,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:29:19,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:19,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:29:19,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:29:19,631 INFO L87 Difference]: Start difference. First operand 33838 states. Second operand 3 states. [2019-12-18 17:29:21,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:21,117 INFO L93 Difference]: Finished difference Result 33638 states and 143712 transitions. [2019-12-18 17:29:21,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:29:21,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 17:29:21,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:21,398 INFO L225 Difference]: With dead ends: 33638 [2019-12-18 17:29:21,398 INFO L226 Difference]: Without dead ends: 32966 [2019-12-18 17:29:21,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:29:21,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32966 states. [2019-12-18 17:29:22,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32966 to 32966. [2019-12-18 17:29:22,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32966 states. [2019-12-18 17:29:23,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32966 states to 32966 states and 140968 transitions. [2019-12-18 17:29:23,515 INFO L78 Accepts]: Start accepts. Automaton has 32966 states and 140968 transitions. Word has length 9 [2019-12-18 17:29:23,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:29:23,516 INFO L462 AbstractCegarLoop]: Abstraction has 32966 states and 140968 transitions. [2019-12-18 17:29:23,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:29:23,517 INFO L276 IsEmpty]: Start isEmpty. Operand 32966 states and 140968 transitions. [2019-12-18 17:29:23,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 17:29:23,532 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:23,533 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:29:23,533 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:29:23,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:23,534 INFO L82 PathProgramCache]: Analyzing trace with hash -666575947, now seen corresponding path program 1 times [2019-12-18 17:29:23,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:23,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055390845] [2019-12-18 17:29:23,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:23,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:23,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:29:23,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055390845] [2019-12-18 17:29:23,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:23,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:29:23,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162843192] [2019-12-18 17:29:23,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:29:23,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:23,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:29:23,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:29:23,675 INFO L87 Difference]: Start difference. First operand 32966 states and 140968 transitions. Second operand 4 states. [2019-12-18 17:29:25,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:25,007 INFO L93 Difference]: Finished difference Result 44494 states and 185824 transitions. [2019-12-18 17:29:25,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:29:25,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 17:29:25,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:27,006 INFO L225 Difference]: With dead ends: 44494 [2019-12-18 17:29:27,006 INFO L226 Difference]: Without dead ends: 44494 [2019-12-18 17:29:27,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:29:27,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44494 states. [2019-12-18 17:29:28,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44494 to 43986. [2019-12-18 17:29:28,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43986 states. [2019-12-18 17:29:28,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43986 states to 43986 states and 183912 transitions. [2019-12-18 17:29:28,590 INFO L78 Accepts]: Start accepts. Automaton has 43986 states and 183912 transitions. Word has length 15 [2019-12-18 17:29:28,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:29:28,591 INFO L462 AbstractCegarLoop]: Abstraction has 43986 states and 183912 transitions. [2019-12-18 17:29:28,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:29:28,591 INFO L276 IsEmpty]: Start isEmpty. Operand 43986 states and 183912 transitions. [2019-12-18 17:29:28,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 17:29:28,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:28,594 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:29:28,594 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:29:28,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:28,595 INFO L82 PathProgramCache]: Analyzing trace with hash 703479247, now seen corresponding path program 1 times [2019-12-18 17:29:28,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:28,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337217116] [2019-12-18 17:29:28,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:28,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:29:28,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337217116] [2019-12-18 17:29:28,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:28,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:29:28,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878169338] [2019-12-18 17:29:28,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:29:28,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:28,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:29:28,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:29:28,689 INFO L87 Difference]: Start difference. First operand 43986 states and 183912 transitions. Second operand 4 states. [2019-12-18 17:29:29,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:29,631 INFO L93 Difference]: Finished difference Result 62082 states and 254960 transitions. [2019-12-18 17:29:29,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:29:29,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 17:29:29,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:29,910 INFO L225 Difference]: With dead ends: 62082 [2019-12-18 17:29:29,910 INFO L226 Difference]: Without dead ends: 62054 [2019-12-18 17:29:29,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:29:30,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62054 states. [2019-12-18 17:29:33,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62054 to 51774. [2019-12-18 17:29:33,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51774 states. [2019-12-18 17:29:34,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51774 states to 51774 states and 215576 transitions. [2019-12-18 17:29:34,068 INFO L78 Accepts]: Start accepts. Automaton has 51774 states and 215576 transitions. Word has length 15 [2019-12-18 17:29:34,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:29:34,068 INFO L462 AbstractCegarLoop]: Abstraction has 51774 states and 215576 transitions. [2019-12-18 17:29:34,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:29:34,068 INFO L276 IsEmpty]: Start isEmpty. Operand 51774 states and 215576 transitions. [2019-12-18 17:29:34,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 17:29:34,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:34,082 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] [2019-12-18 17:29:34,082 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:29:34,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:34,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1831569488, now seen corresponding path program 1 times [2019-12-18 17:29:34,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:34,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994506005] [2019-12-18 17:29:34,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:34,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:29:34,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994506005] [2019-12-18 17:29:34,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:34,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:29:34,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532796909] [2019-12-18 17:29:34,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:29:34,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:34,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:29:34,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:29:34,173 INFO L87 Difference]: Start difference. First operand 51774 states and 215576 transitions. Second operand 5 states. [2019-12-18 17:29:35,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:35,382 INFO L93 Difference]: Finished difference Result 68854 states and 281988 transitions. [2019-12-18 17:29:35,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:29:35,382 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-18 17:29:35,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:35,556 INFO L225 Difference]: With dead ends: 68854 [2019-12-18 17:29:35,556 INFO L226 Difference]: Without dead ends: 68826 [2019-12-18 17:29:35,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:29:35,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68826 states. [2019-12-18 17:29:39,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68826 to 51450. [2019-12-18 17:29:39,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51450 states. [2019-12-18 17:29:39,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51450 states to 51450 states and 213896 transitions. [2019-12-18 17:29:39,654 INFO L78 Accepts]: Start accepts. Automaton has 51450 states and 213896 transitions. Word has length 21 [2019-12-18 17:29:39,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:29:39,655 INFO L462 AbstractCegarLoop]: Abstraction has 51450 states and 213896 transitions. [2019-12-18 17:29:39,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:29:39,655 INFO L276 IsEmpty]: Start isEmpty. Operand 51450 states and 213896 transitions. [2019-12-18 17:29:39,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 17:29:39,718 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:39,718 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] [2019-12-18 17:29:39,718 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:29:39,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:39,719 INFO L82 PathProgramCache]: Analyzing trace with hash 2027885083, now seen corresponding path program 1 times [2019-12-18 17:29:39,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:39,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699104972] [2019-12-18 17:29:39,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:39,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:29:39,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699104972] [2019-12-18 17:29:39,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:39,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:29:39,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892766573] [2019-12-18 17:29:39,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:29:39,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:39,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:29:39,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:29:39,814 INFO L87 Difference]: Start difference. First operand 51450 states and 213896 transitions. Second operand 3 states. [2019-12-18 17:29:40,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:40,172 INFO L93 Difference]: Finished difference Result 64130 states and 263832 transitions. [2019-12-18 17:29:40,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:29:40,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-18 17:29:40,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:40,329 INFO L225 Difference]: With dead ends: 64130 [2019-12-18 17:29:40,329 INFO L226 Difference]: Without dead ends: 64130 [2019-12-18 17:29:40,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:29:40,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64130 states. [2019-12-18 17:29:43,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64130 to 56646. [2019-12-18 17:29:43,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56646 states. [2019-12-18 17:29:44,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56646 states to 56646 states and 234808 transitions. [2019-12-18 17:29:44,322 INFO L78 Accepts]: Start accepts. Automaton has 56646 states and 234808 transitions. Word has length 29 [2019-12-18 17:29:44,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:29:44,322 INFO L462 AbstractCegarLoop]: Abstraction has 56646 states and 234808 transitions. [2019-12-18 17:29:44,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:29:44,323 INFO L276 IsEmpty]: Start isEmpty. Operand 56646 states and 234808 transitions. [2019-12-18 17:29:44,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 17:29:44,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:44,361 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] [2019-12-18 17:29:44,362 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:29:44,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:44,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1811393886, now seen corresponding path program 1 times [2019-12-18 17:29:44,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:44,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454551588] [2019-12-18 17:29:44,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:44,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:29:44,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454551588] [2019-12-18 17:29:44,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:44,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:29:44,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525121675] [2019-12-18 17:29:44,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:29:44,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:44,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:29:44,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:29:44,492 INFO L87 Difference]: Start difference. First operand 56646 states and 234808 transitions. Second operand 6 states. [2019-12-18 17:29:45,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:45,241 INFO L93 Difference]: Finished difference Result 81602 states and 332376 transitions. [2019-12-18 17:29:45,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:29:45,241 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-18 17:29:45,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:45,447 INFO L225 Difference]: With dead ends: 81602 [2019-12-18 17:29:45,448 INFO L226 Difference]: Without dead ends: 81538 [2019-12-18 17:29:45,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:29:45,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81538 states. [2019-12-18 17:29:47,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81538 to 65578. [2019-12-18 17:29:47,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65578 states. [2019-12-18 17:29:51,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65578 states to 65578 states and 270440 transitions. [2019-12-18 17:29:51,183 INFO L78 Accepts]: Start accepts. Automaton has 65578 states and 270440 transitions. Word has length 29 [2019-12-18 17:29:51,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:29:51,184 INFO L462 AbstractCegarLoop]: Abstraction has 65578 states and 270440 transitions. [2019-12-18 17:29:51,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:29:51,184 INFO L276 IsEmpty]: Start isEmpty. Operand 65578 states and 270440 transitions. [2019-12-18 17:29:51,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 17:29:51,255 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:51,255 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] [2019-12-18 17:29:51,255 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:29:51,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:51,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1048930675, now seen corresponding path program 1 times [2019-12-18 17:29:51,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:51,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305750380] [2019-12-18 17:29:51,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:51,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:29:51,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305750380] [2019-12-18 17:29:51,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:51,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:29:51,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735074026] [2019-12-18 17:29:51,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:29:51,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:51,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:29:51,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:29:51,331 INFO L87 Difference]: Start difference. First operand 65578 states and 270440 transitions. Second operand 3 states. [2019-12-18 17:29:51,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:51,691 INFO L93 Difference]: Finished difference Result 65578 states and 269720 transitions. [2019-12-18 17:29:51,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:29:51,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-12-18 17:29:51,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:51,851 INFO L225 Difference]: With dead ends: 65578 [2019-12-18 17:29:51,851 INFO L226 Difference]: Without dead ends: 65578 [2019-12-18 17:29:51,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:29:52,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65578 states. [2019-12-18 17:29:53,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65578 to 65578. [2019-12-18 17:29:53,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65578 states. [2019-12-18 17:29:53,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65578 states to 65578 states and 269720 transitions. [2019-12-18 17:29:53,550 INFO L78 Accepts]: Start accepts. Automaton has 65578 states and 269720 transitions. Word has length 35 [2019-12-18 17:29:53,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:29:53,550 INFO L462 AbstractCegarLoop]: Abstraction has 65578 states and 269720 transitions. [2019-12-18 17:29:53,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:29:53,551 INFO L276 IsEmpty]: Start isEmpty. Operand 65578 states and 269720 transitions. [2019-12-18 17:29:53,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 17:29:53,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:53,607 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] [2019-12-18 17:29:53,607 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:29:53,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:53,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1735231015, now seen corresponding path program 1 times [2019-12-18 17:29:53,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:53,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352122996] [2019-12-18 17:29:53,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:53,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:53,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:29:53,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352122996] [2019-12-18 17:29:53,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:53,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:29:53,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869995729] [2019-12-18 17:29:53,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:29:53,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:53,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:29:53,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:29:53,692 INFO L87 Difference]: Start difference. First operand 65578 states and 269720 transitions. Second operand 7 states. [2019-12-18 17:29:55,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:55,498 INFO L93 Difference]: Finished difference Result 89414 states and 361616 transitions. [2019-12-18 17:29:55,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 17:29:55,499 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-18 17:29:55,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:55,734 INFO L225 Difference]: With dead ends: 89414 [2019-12-18 17:29:55,734 INFO L226 Difference]: Without dead ends: 89310 [2019-12-18 17:29:55,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-18 17:29:56,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89310 states. [2019-12-18 17:29:57,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89310 to 58886. [2019-12-18 17:29:57,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58886 states. [2019-12-18 17:29:57,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58886 states to 58886 states and 243296 transitions. [2019-12-18 17:29:57,878 INFO L78 Accepts]: Start accepts. Automaton has 58886 states and 243296 transitions. Word has length 35 [2019-12-18 17:29:57,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:29:57,878 INFO L462 AbstractCegarLoop]: Abstraction has 58886 states and 243296 transitions. [2019-12-18 17:29:57,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:29:57,879 INFO L276 IsEmpty]: Start isEmpty. Operand 58886 states and 243296 transitions. [2019-12-18 17:29:57,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 17:29:57,944 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:57,945 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] [2019-12-18 17:29:57,945 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:29:57,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:57,945 INFO L82 PathProgramCache]: Analyzing trace with hash 903389864, now seen corresponding path program 1 times [2019-12-18 17:29:57,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:57,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473403202] [2019-12-18 17:29:57,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:58,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:29:58,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473403202] [2019-12-18 17:29:58,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:58,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:29:58,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415731457] [2019-12-18 17:29:58,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:29:58,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:58,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:29:58,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:29:58,060 INFO L87 Difference]: Start difference. First operand 58886 states and 243296 transitions. Second operand 6 states. [2019-12-18 17:29:59,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:59,266 INFO L93 Difference]: Finished difference Result 74494 states and 310372 transitions. [2019-12-18 17:29:59,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 17:29:59,267 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-12-18 17:29:59,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:59,447 INFO L225 Difference]: With dead ends: 74494 [2019-12-18 17:29:59,447 INFO L226 Difference]: Without dead ends: 71114 [2019-12-18 17:29:59,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:29:59,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71114 states. [2019-12-18 17:30:00,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71114 to 65978. [2019-12-18 17:30:00,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65978 states. [2019-12-18 17:30:04,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65978 states to 65978 states and 274224 transitions. [2019-12-18 17:30:04,384 INFO L78 Accepts]: Start accepts. Automaton has 65978 states and 274224 transitions. Word has length 35 [2019-12-18 17:30:04,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:30:04,385 INFO L462 AbstractCegarLoop]: Abstraction has 65978 states and 274224 transitions. [2019-12-18 17:30:04,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:30:04,385 INFO L276 IsEmpty]: Start isEmpty. Operand 65978 states and 274224 transitions. [2019-12-18 17:30:04,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 17:30:04,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:30:04,451 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] [2019-12-18 17:30:04,451 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:30:04,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:30:04,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1363817762, now seen corresponding path program 1 times [2019-12-18 17:30:04,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:30:04,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758696048] [2019-12-18 17:30:04,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:30:04,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:30:04,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:30:04,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758696048] [2019-12-18 17:30:04,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:30:04,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 17:30:04,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667850348] [2019-12-18 17:30:04,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:30:04,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:30:04,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:30:04,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:30:04,643 INFO L87 Difference]: Start difference. First operand 65978 states and 274224 transitions. Second operand 9 states. [2019-12-18 17:30:05,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:30:05,643 INFO L93 Difference]: Finished difference Result 118218 states and 493264 transitions. [2019-12-18 17:30:05,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 17:30:05,644 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2019-12-18 17:30:05,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:30:05,934 INFO L225 Difference]: With dead ends: 118218 [2019-12-18 17:30:05,934 INFO L226 Difference]: Without dead ends: 98890 [2019-12-18 17:30:05,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-12-18 17:30:06,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98890 states. [2019-12-18 17:30:08,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98890 to 93605. [2019-12-18 17:30:08,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93605 states. [2019-12-18 17:30:13,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93605 states to 93605 states and 391402 transitions. [2019-12-18 17:30:13,030 INFO L78 Accepts]: Start accepts. Automaton has 93605 states and 391402 transitions. Word has length 37 [2019-12-18 17:30:13,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:30:13,030 INFO L462 AbstractCegarLoop]: Abstraction has 93605 states and 391402 transitions. [2019-12-18 17:30:13,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:30:13,030 INFO L276 IsEmpty]: Start isEmpty. Operand 93605 states and 391402 transitions. [2019-12-18 17:30:13,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-18 17:30:13,159 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:30:13,159 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] [2019-12-18 17:30:13,159 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:30:13,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:30:13,159 INFO L82 PathProgramCache]: Analyzing trace with hash -475384636, now seen corresponding path program 1 times [2019-12-18 17:30:13,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:30:13,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426125623] [2019-12-18 17:30:13,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:30:13,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:30:13,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:30:13,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426125623] [2019-12-18 17:30:13,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:30:13,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 17:30:13,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162489563] [2019-12-18 17:30:13,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 17:30:13,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:30:13,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 17:30:13,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:30:13,360 INFO L87 Difference]: Start difference. First operand 93605 states and 391402 transitions. Second operand 11 states. [2019-12-18 17:30:15,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:30:15,002 INFO L93 Difference]: Finished difference Result 148536 states and 617986 transitions. [2019-12-18 17:30:15,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 17:30:15,002 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2019-12-18 17:30:15,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:30:15,365 INFO L225 Difference]: With dead ends: 148536 [2019-12-18 17:30:15,365 INFO L226 Difference]: Without dead ends: 128952 [2019-12-18 17:30:15,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2019-12-18 17:30:16,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128952 states. [2019-12-18 17:30:17,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128952 to 88366. [2019-12-18 17:30:17,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88366 states. [2019-12-18 17:30:19,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88366 states to 88366 states and 365660 transitions. [2019-12-18 17:30:19,155 INFO L78 Accepts]: Start accepts. Automaton has 88366 states and 365660 transitions. Word has length 38 [2019-12-18 17:30:19,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:30:19,156 INFO L462 AbstractCegarLoop]: Abstraction has 88366 states and 365660 transitions. [2019-12-18 17:30:19,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 17:30:19,156 INFO L276 IsEmpty]: Start isEmpty. Operand 88366 states and 365660 transitions. [2019-12-18 17:30:19,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-18 17:30:19,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:30:19,277 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] [2019-12-18 17:30:19,278 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:30:19,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:30:19,278 INFO L82 PathProgramCache]: Analyzing trace with hash 438975875, now seen corresponding path program 1 times [2019-12-18 17:30:19,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:30:19,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635028449] [2019-12-18 17:30:19,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:30:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:30:19,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:30:19,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635028449] [2019-12-18 17:30:19,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:30:19,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:30:19,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455676844] [2019-12-18 17:30:19,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:30:19,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:30:19,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:30:19,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:30:19,465 INFO L87 Difference]: Start difference. First operand 88366 states and 365660 transitions. Second operand 7 states. [2019-12-18 17:30:20,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:30:20,053 INFO L93 Difference]: Finished difference Result 80510 states and 326204 transitions. [2019-12-18 17:30:20,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:30:20,054 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-12-18 17:30:20,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:30:20,238 INFO L225 Difference]: With dead ends: 80510 [2019-12-18 17:30:20,238 INFO L226 Difference]: Without dead ends: 76838 [2019-12-18 17:30:20,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:30:20,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76838 states. [2019-12-18 17:30:25,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76838 to 72518. [2019-12-18 17:30:25,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72518 states. [2019-12-18 17:30:25,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72518 states to 72518 states and 296204 transitions. [2019-12-18 17:30:25,759 INFO L78 Accepts]: Start accepts. Automaton has 72518 states and 296204 transitions. Word has length 38 [2019-12-18 17:30:25,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:30:25,760 INFO L462 AbstractCegarLoop]: Abstraction has 72518 states and 296204 transitions. [2019-12-18 17:30:25,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:30:25,760 INFO L276 IsEmpty]: Start isEmpty. Operand 72518 states and 296204 transitions. [2019-12-18 17:30:25,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-18 17:30:25,847 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:30:25,847 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] [2019-12-18 17:30:25,847 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:30:25,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:30:25,848 INFO L82 PathProgramCache]: Analyzing trace with hash 600751842, now seen corresponding path program 2 times [2019-12-18 17:30:25,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:30:25,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359632789] [2019-12-18 17:30:25,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:30:25,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:30:25,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:30:25,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359632789] [2019-12-18 17:30:25,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:30:25,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:30:25,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080738976] [2019-12-18 17:30:25,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 17:30:25,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:30:25,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 17:30:25,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-18 17:30:25,986 INFO L87 Difference]: Start difference. First operand 72518 states and 296204 transitions. Second operand 10 states. [2019-12-18 17:30:27,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:30:27,090 INFO L93 Difference]: Finished difference Result 136553 states and 559536 transitions. [2019-12-18 17:30:27,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 17:30:27,091 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2019-12-18 17:30:27,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:30:27,399 INFO L225 Difference]: With dead ends: 136553 [2019-12-18 17:30:27,399 INFO L226 Difference]: Without dead ends: 117725 [2019-12-18 17:30:27,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2019-12-18 17:30:28,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117725 states. [2019-12-18 17:30:29,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117725 to 70790. [2019-12-18 17:30:29,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70790 states. [2019-12-18 17:30:29,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70790 states to 70790 states and 287948 transitions. [2019-12-18 17:30:29,983 INFO L78 Accepts]: Start accepts. Automaton has 70790 states and 287948 transitions. Word has length 38 [2019-12-18 17:30:29,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:30:29,984 INFO L462 AbstractCegarLoop]: Abstraction has 70790 states and 287948 transitions. [2019-12-18 17:30:29,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 17:30:29,984 INFO L276 IsEmpty]: Start isEmpty. Operand 70790 states and 287948 transitions. [2019-12-18 17:30:30,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 17:30:30,076 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:30:30,076 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:30:30,076 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:30:30,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:30:30,076 INFO L82 PathProgramCache]: Analyzing trace with hash 922127842, now seen corresponding path program 1 times [2019-12-18 17:30:30,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:30:30,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926191444] [2019-12-18 17:30:30,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:30:30,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:30:30,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-18 17:30:30,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926191444] [2019-12-18 17:30:30,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:30:30,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:30:30,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965539023] [2019-12-18 17:30:30,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:30:30,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:30:30,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:30:30,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:30:30,159 INFO L87 Difference]: Start difference. First operand 70790 states and 287948 transitions. Second operand 4 states. [2019-12-18 17:30:30,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:30:30,421 INFO L93 Difference]: Finished difference Result 56238 states and 210137 transitions. [2019-12-18 17:30:30,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:30:30,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-18 17:30:30,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:30:31,450 INFO L225 Difference]: With dead ends: 56238 [2019-12-18 17:30:31,450 INFO L226 Difference]: Without dead ends: 55066 [2019-12-18 17:30:31,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:30:31,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55066 states. [2019-12-18 17:30:32,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55066 to 55066. [2019-12-18 17:30:32,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55066 states. [2019-12-18 17:30:32,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55066 states to 55066 states and 206437 transitions. [2019-12-18 17:30:32,366 INFO L78 Accepts]: Start accepts. Automaton has 55066 states and 206437 transitions. Word has length 39 [2019-12-18 17:30:32,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:30:32,366 INFO L462 AbstractCegarLoop]: Abstraction has 55066 states and 206437 transitions. [2019-12-18 17:30:32,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:30:32,366 INFO L276 IsEmpty]: Start isEmpty. Operand 55066 states and 206437 transitions. [2019-12-18 17:30:32,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 17:30:32,425 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:30:32,425 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:30:32,425 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:30:32,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:30:32,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1151366660, now seen corresponding path program 1 times [2019-12-18 17:30:32,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:30:32,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187759466] [2019-12-18 17:30:32,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:30:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:30:32,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:30:32,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187759466] [2019-12-18 17:30:32,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:30:32,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:30:32,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891248944] [2019-12-18 17:30:32,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:30:32,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:30:32,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:30:32,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:30:32,559 INFO L87 Difference]: Start difference. First operand 55066 states and 206437 transitions. Second operand 6 states. [2019-12-18 17:30:32,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:30:32,940 INFO L93 Difference]: Finished difference Result 80768 states and 296674 transitions. [2019-12-18 17:30:32,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:30:32,940 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 17:30:32,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:30:33,034 INFO L225 Difference]: With dead ends: 80768 [2019-12-18 17:30:33,034 INFO L226 Difference]: Without dead ends: 45706 [2019-12-18 17:30:33,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:30:33,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45706 states. [2019-12-18 17:30:34,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45706 to 45706. [2019-12-18 17:30:34,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45706 states. [2019-12-18 17:30:34,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45706 states to 45706 states and 168716 transitions. [2019-12-18 17:30:34,318 INFO L78 Accepts]: Start accepts. Automaton has 45706 states and 168716 transitions. Word has length 40 [2019-12-18 17:30:34,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:30:34,318 INFO L462 AbstractCegarLoop]: Abstraction has 45706 states and 168716 transitions. [2019-12-18 17:30:34,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:30:34,318 INFO L276 IsEmpty]: Start isEmpty. Operand 45706 states and 168716 transitions. [2019-12-18 17:30:34,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 17:30:34,364 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:30:34,364 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:30:34,364 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:30:34,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:30:34,364 INFO L82 PathProgramCache]: Analyzing trace with hash 71622762, now seen corresponding path program 2 times [2019-12-18 17:30:34,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:30:34,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992471771] [2019-12-18 17:30:34,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:30:34,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:30:34,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:30:34,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992471771] [2019-12-18 17:30:34,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:30:34,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:30:34,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037425548] [2019-12-18 17:30:34,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:30:34,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:30:34,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:30:34,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:30:34,435 INFO L87 Difference]: Start difference. First operand 45706 states and 168716 transitions. Second operand 5 states. [2019-12-18 17:30:34,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:30:34,533 INFO L93 Difference]: Finished difference Result 16000 states and 49798 transitions. [2019-12-18 17:30:34,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:30:34,534 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 17:30:34,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:30:34,555 INFO L225 Difference]: With dead ends: 16000 [2019-12-18 17:30:34,555 INFO L226 Difference]: Without dead ends: 15146 [2019-12-18 17:30:34,555 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-18 17:30:34,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15146 states. [2019-12-18 17:30:34,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15146 to 15146. [2019-12-18 17:30:34,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15146 states. [2019-12-18 17:30:34,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15146 states to 15146 states and 47069 transitions. [2019-12-18 17:30:34,764 INFO L78 Accepts]: Start accepts. Automaton has 15146 states and 47069 transitions. Word has length 40 [2019-12-18 17:30:34,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:30:34,764 INFO L462 AbstractCegarLoop]: Abstraction has 15146 states and 47069 transitions. [2019-12-18 17:30:34,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:30:34,764 INFO L276 IsEmpty]: Start isEmpty. Operand 15146 states and 47069 transitions. [2019-12-18 17:30:34,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 17:30:34,774 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:30:34,774 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:30:34,774 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:30:34,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:30:34,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1368489979, now seen corresponding path program 1 times [2019-12-18 17:30:34,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:30:34,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799047282] [2019-12-18 17:30:34,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:30:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:30:34,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:30:34,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799047282] [2019-12-18 17:30:34,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:30:34,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:30:34,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107965585] [2019-12-18 17:30:34,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:30:34,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:30:34,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:30:34,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:30:34,845 INFO L87 Difference]: Start difference. First operand 15146 states and 47069 transitions. Second operand 6 states. [2019-12-18 17:30:34,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:30:34,933 INFO L93 Difference]: Finished difference Result 3176 states and 7971 transitions. [2019-12-18 17:30:34,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:30:34,934 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 17:30:34,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:30:34,938 INFO L225 Difference]: With dead ends: 3176 [2019-12-18 17:30:34,938 INFO L226 Difference]: Without dead ends: 2829 [2019-12-18 17:30:34,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:30:34,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2829 states. [2019-12-18 17:30:34,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2829 to 2765. [2019-12-18 17:30:34,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2765 states. [2019-12-18 17:30:34,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2765 states to 2765 states and 6785 transitions. [2019-12-18 17:30:34,979 INFO L78 Accepts]: Start accepts. Automaton has 2765 states and 6785 transitions. Word has length 41 [2019-12-18 17:30:34,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:30:34,979 INFO L462 AbstractCegarLoop]: Abstraction has 2765 states and 6785 transitions. [2019-12-18 17:30:34,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:30:34,979 INFO L276 IsEmpty]: Start isEmpty. Operand 2765 states and 6785 transitions. [2019-12-18 17:30:34,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 17:30:34,982 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:30:34,982 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] [2019-12-18 17:30:34,983 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:30:34,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:30:34,983 INFO L82 PathProgramCache]: Analyzing trace with hash -784185183, now seen corresponding path program 1 times [2019-12-18 17:30:34,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:30:34,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231072764] [2019-12-18 17:30:34,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:30:35,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:30:35,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:30:35,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231072764] [2019-12-18 17:30:35,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:30:35,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:30:35,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648112805] [2019-12-18 17:30:35,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:30:35,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:30:35,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:30:35,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:30:35,085 INFO L87 Difference]: Start difference. First operand 2765 states and 6785 transitions. Second operand 7 states. [2019-12-18 17:30:35,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:30:35,178 INFO L93 Difference]: Finished difference Result 1208 states and 3304 transitions. [2019-12-18 17:30:35,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:30:35,178 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-18 17:30:35,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:30:35,181 INFO L225 Difference]: With dead ends: 1208 [2019-12-18 17:30:35,181 INFO L226 Difference]: Without dead ends: 1162 [2019-12-18 17:30:35,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:30:35,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2019-12-18 17:30:35,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1050. [2019-12-18 17:30:35,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1050 states. [2019-12-18 17:30:35,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 2894 transitions. [2019-12-18 17:30:35,195 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 2894 transitions. Word has length 48 [2019-12-18 17:30:35,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:30:35,195 INFO L462 AbstractCegarLoop]: Abstraction has 1050 states and 2894 transitions. [2019-12-18 17:30:35,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:30:35,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 2894 transitions. [2019-12-18 17:30:35,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:30:35,197 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:30:35,197 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:30:35,197 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:30:35,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:30:35,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1193491105, now seen corresponding path program 1 times [2019-12-18 17:30:35,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:30:35,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562735740] [2019-12-18 17:30:35,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:30:35,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:30:35,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:30:35,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562735740] [2019-12-18 17:30:35,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:30:35,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:30:35,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171868400] [2019-12-18 17:30:35,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:30:35,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:30:35,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:30:35,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:30:35,303 INFO L87 Difference]: Start difference. First operand 1050 states and 2894 transitions. Second operand 6 states. [2019-12-18 17:30:35,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:30:35,370 INFO L93 Difference]: Finished difference Result 1576 states and 4065 transitions. [2019-12-18 17:30:35,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:30:35,371 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-18 17:30:35,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:30:35,372 INFO L225 Difference]: With dead ends: 1576 [2019-12-18 17:30:35,372 INFO L226 Difference]: Without dead ends: 587 [2019-12-18 17:30:35,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:30:35,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-12-18 17:30:35,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-12-18 17:30:35,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-12-18 17:30:35,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 1308 transitions. [2019-12-18 17:30:35,381 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 1308 transitions. Word has length 59 [2019-12-18 17:30:35,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:30:35,381 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 1308 transitions. [2019-12-18 17:30:35,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:30:35,381 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 1308 transitions. [2019-12-18 17:30:35,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:30:35,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:30:35,383 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:30:35,383 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:30:35,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:30:35,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1632162753, now seen corresponding path program 2 times [2019-12-18 17:30:35,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:30:35,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403576255] [2019-12-18 17:30:35,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:30:35,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:30:35,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:30:35,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403576255] [2019-12-18 17:30:35,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:30:35,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:30:35,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226296729] [2019-12-18 17:30:35,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:30:35,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:30:35,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:30:35,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:30:35,438 INFO L87 Difference]: Start difference. First operand 587 states and 1308 transitions. Second operand 3 states. [2019-12-18 17:30:35,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:30:35,453 INFO L93 Difference]: Finished difference Result 564 states and 1228 transitions. [2019-12-18 17:30:35,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:30:35,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 17:30:35,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:30:35,454 INFO L225 Difference]: With dead ends: 564 [2019-12-18 17:30:35,455 INFO L226 Difference]: Without dead ends: 564 [2019-12-18 17:30:35,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:30:35,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-12-18 17:30:35,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2019-12-18 17:30:35,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-12-18 17:30:35,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 1228 transitions. [2019-12-18 17:30:35,462 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 1228 transitions. Word has length 59 [2019-12-18 17:30:35,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:30:35,463 INFO L462 AbstractCegarLoop]: Abstraction has 564 states and 1228 transitions. [2019-12-18 17:30:35,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:30:35,463 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 1228 transitions. [2019-12-18 17:30:35,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 17:30:35,464 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:30:35,464 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] [2019-12-18 17:30:35,464 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:30:35,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:30:35,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1384719400, now seen corresponding path program 1 times [2019-12-18 17:30:35,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:30:35,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197790324] [2019-12-18 17:30:35,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:30:35,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:30:35,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:30:35,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197790324] [2019-12-18 17:30:35,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:30:35,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 17:30:35,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84122060] [2019-12-18 17:30:35,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 17:30:35,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:30:35,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 17:30:35,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:30:35,726 INFO L87 Difference]: Start difference. First operand 564 states and 1228 transitions. Second operand 13 states. [2019-12-18 17:30:36,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:30:36,335 INFO L93 Difference]: Finished difference Result 899 states and 1970 transitions. [2019-12-18 17:30:36,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 17:30:36,336 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-18 17:30:36,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:30:36,337 INFO L225 Difference]: With dead ends: 899 [2019-12-18 17:30:36,337 INFO L226 Difference]: Without dead ends: 714 [2019-12-18 17:30:36,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-12-18 17:30:36,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-12-18 17:30:36,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 588. [2019-12-18 17:30:36,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-12-18 17:30:36,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1280 transitions. [2019-12-18 17:30:36,354 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1280 transitions. Word has length 60 [2019-12-18 17:30:36,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:30:36,355 INFO L462 AbstractCegarLoop]: Abstraction has 588 states and 1280 transitions. [2019-12-18 17:30:36,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 17:30:36,355 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1280 transitions. [2019-12-18 17:30:36,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 17:30:36,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:30:36,357 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:30:36,357 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:30:36,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:30:36,358 INFO L82 PathProgramCache]: Analyzing trace with hash -713679046, now seen corresponding path program 2 times [2019-12-18 17:30:36,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:30:36,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493282786] [2019-12-18 17:30:36,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:30:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:30:36,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:30:36,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493282786] [2019-12-18 17:30:36,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:30:36,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 17:30:36,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951878199] [2019-12-18 17:30:36,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 17:30:36,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:30:36,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 17:30:36,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-18 17:30:36,716 INFO L87 Difference]: Start difference. First operand 588 states and 1280 transitions. Second operand 15 states. [2019-12-18 17:30:37,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:30:37,408 INFO L93 Difference]: Finished difference Result 843 states and 1818 transitions. [2019-12-18 17:30:37,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 17:30:37,408 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2019-12-18 17:30:37,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:30:37,410 INFO L225 Difference]: With dead ends: 843 [2019-12-18 17:30:37,411 INFO L226 Difference]: Without dead ends: 698 [2019-12-18 17:30:37,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2019-12-18 17:30:37,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2019-12-18 17:30:37,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 580. [2019-12-18 17:30:37,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-12-18 17:30:37,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 1258 transitions. [2019-12-18 17:30:37,421 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 1258 transitions. Word has length 60 [2019-12-18 17:30:37,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:30:37,422 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 1258 transitions. [2019-12-18 17:30:37,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 17:30:37,422 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 1258 transitions. [2019-12-18 17:30:37,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 17:30:37,423 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:30:37,423 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] [2019-12-18 17:30:37,423 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:30:37,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:30:37,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1887301962, now seen corresponding path program 3 times [2019-12-18 17:30:37,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:30:37,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814525519] [2019-12-18 17:30:37,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:30:37,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:30:37,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:30:37,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814525519] [2019-12-18 17:30:37,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:30:37,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 17:30:37,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156739296] [2019-12-18 17:30:37,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 17:30:37,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:30:37,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 17:30:37,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:30:37,670 INFO L87 Difference]: Start difference. First operand 580 states and 1258 transitions. Second operand 13 states. [2019-12-18 17:30:38,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:30:38,243 INFO L93 Difference]: Finished difference Result 717 states and 1514 transitions. [2019-12-18 17:30:38,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 17:30:38,244 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-18 17:30:38,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:30:38,245 INFO L225 Difference]: With dead ends: 717 [2019-12-18 17:30:38,245 INFO L226 Difference]: Without dead ends: 532 [2019-12-18 17:30:38,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2019-12-18 17:30:38,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-12-18 17:30:38,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2019-12-18 17:30:38,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-12-18 17:30:38,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 1146 transitions. [2019-12-18 17:30:38,252 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 1146 transitions. Word has length 60 [2019-12-18 17:30:38,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:30:38,252 INFO L462 AbstractCegarLoop]: Abstraction has 532 states and 1146 transitions. [2019-12-18 17:30:38,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 17:30:38,252 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 1146 transitions. [2019-12-18 17:30:38,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 17:30:38,253 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:30:38,253 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] [2019-12-18 17:30:38,253 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:30:38,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:30:38,253 INFO L82 PathProgramCache]: Analyzing trace with hash 483952232, now seen corresponding path program 4 times [2019-12-18 17:30:38,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:30:38,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477648007] [2019-12-18 17:30:38,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:30:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:30:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:30:38,365 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:30:38,366 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:30:38,370 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= (store |v_#length_28| |v_ULTIMATE.start_main_~#t1157~0.base_21| 4) |v_#length_27|) (= v_~z$r_buff1_thd1~0_136 0) (= 0 v_~__unbuffered_p3_EBX~0_151) (= 0 v_~__unbuffered_p0_EAX~0_45) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= v_~__unbuffered_p3_EAX~0_151 0) (= v_~__unbuffered_cnt~0_172 0) (= v_~main$tmp_guard0~0_29 0) (= v_~z$r_buff1_thd0~0_320 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1157~0.base_21|) 0) (= v_~y~0_38 0) (= v_~z$w_buff1~0_115 0) (= 0 v_~weak$$choice0~0_17) (= v_~z$mem_tmp~0_24 0) (= v_~z$read_delayed~0_5 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t1157~0.base_21| 1)) (= v_~z$r_buff0_thd2~0_135 0) (= 0 v_~z$r_buff1_thd3~0_221) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff1_thd2~0_136 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1157~0.base_21|) (= v_~z$w_buff1_used~0_340 0) (= v_~main$tmp_guard1~0_28 0) (= 0 |v_ULTIMATE.start_main_~#t1157~0.offset_16|) (= 0 v_~z$flush_delayed~0_43) (= v_~z$w_buff0_used~0_571 0) (= v_~b~0_164 0) (= 0 v_~z$r_buff0_thd3~0_200) (< 0 |v_#StackHeapBarrier_20|) (= 0 |v_#NULL.base_7|) (= v_~z~0_188 0) (= v_~weak$$choice2~0_123 0) (= v_~a~0_136 0) (= v_~z$r_buff0_thd0~0_374 0) (= v_~z$r_buff0_thd1~0_137 0) (= 0 v_~__unbuffered_p1_EAX~0_36) (= 0 v_~z$r_buff1_thd4~0_193) (= v_~z$w_buff0~0_113 0) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1157~0.base_21| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1157~0.base_21|) |v_ULTIMATE.start_main_~#t1157~0.offset_16| 0)) |v_#memory_int_27|) (= v_~x~0_47 0) (= 0 v_~z$r_buff0_thd4~0_323))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_28|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_~#t1157~0.offset=|v_ULTIMATE.start_main_~#t1157~0.offset_16|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_80|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_136, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_40|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_35|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_27|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_16|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_32|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_49|, ~a~0=v_~a~0_136, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_374, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_45, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_323, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_151, #length=|v_#length_27|, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_73|, ULTIMATE.start_main_~#t1157~0.base=|v_ULTIMATE.start_main_~#t1157~0.base_21|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_105|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_340, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_192|, ~z$flush_delayed~0=v_~z$flush_delayed~0_43, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_18|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_28|, ULTIMATE.start_main_~#t1158~0.base=|v_ULTIMATE.start_main_~#t1158~0.base_22|, ~weak$$choice0~0=v_~weak$$choice0~0_17, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_44|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_136, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, ~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_200, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_172, ~x~0=v_~x~0_47, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_193, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_27|, ULTIMATE.start_main_~#t1159~0.base=|v_ULTIMATE.start_main_~#t1159~0.base_21|, ULTIMATE.start_main_~#t1160~0.offset=|v_ULTIMATE.start_main_~#t1160~0.offset_16|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~z$w_buff1~0=v_~z$w_buff1~0_115, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_42|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_22|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_32|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_35|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_33|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_320, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_26|, ~y~0=v_~y~0_38, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_135, ULTIMATE.start_main_~#t1160~0.base=|v_ULTIMATE.start_main_~#t1160~0.base_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_571, ~z$w_buff0~0=v_~z$w_buff0~0_113, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_30|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_26|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_221, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_120|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_30|, ULTIMATE.start_main_~#t1159~0.offset=|v_ULTIMATE.start_main_~#t1159~0.offset_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_151, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_27|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_24|, ~b~0=v_~b~0_164, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_15|, ULTIMATE.start_main_~#t1158~0.offset=|v_ULTIMATE.start_main_~#t1158~0.offset_16|, ~z~0=v_~z~0_188, ~weak$$choice2~0=v_~weak$$choice2~0_123, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_137} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1157~0.offset, ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1157~0.base, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_~#t1158~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t1159~0.base, ULTIMATE.start_main_~#t1160~0.offset, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1160~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t1159~0.offset, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ULTIMATE.start_main_~#t1158~0.offset, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 17:30:38,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L835-1-->L837: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1158~0.base_12| 0)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1158~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t1158~0.offset_10|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1158~0.base_12| 4)) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1158~0.base_12| 1)) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1158~0.base_12|)) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1158~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1158~0.base_12|) |v_ULTIMATE.start_main_~#t1158~0.offset_10| 1)) |v_#memory_int_21|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1158~0.base=|v_ULTIMATE.start_main_~#t1158~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1158~0.offset=|v_ULTIMATE.start_main_~#t1158~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1158~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1158~0.offset] because there is no mapped edge [2019-12-18 17:30:38,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L837-1-->L839: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1159~0.offset_8|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1159~0.base_8|) (not (= 0 |v_ULTIMATE.start_main_~#t1159~0.base_8|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1159~0.base_8| 4)) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1159~0.base_8|)) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1159~0.base_8| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1159~0.base_8|) |v_ULTIMATE.start_main_~#t1159~0.offset_8| 2))) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1159~0.base_8| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1159~0.base=|v_ULTIMATE.start_main_~#t1159~0.base_8|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_3|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1159~0.offset=|v_ULTIMATE.start_main_~#t1159~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1159~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1159~0.offset] because there is no mapped edge [2019-12-18 17:30:38,373 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L839-1-->L841: Formula: (and (= |v_ULTIMATE.start_main_~#t1160~0.offset_10| 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1160~0.base_12| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1160~0.base_12|) |v_ULTIMATE.start_main_~#t1160~0.offset_10| 3)) |v_#memory_int_23|) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1160~0.base_12| 1)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1160~0.base_12|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1160~0.base_12| 4)) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1160~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t1160~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1160~0.base=|v_ULTIMATE.start_main_~#t1160~0.base_12|, ULTIMATE.start_main_~#t1160~0.offset=|v_ULTIMATE.start_main_~#t1160~0.offset_10|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_23|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1160~0.base, ULTIMATE.start_main_~#t1160~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-18 17:30:38,375 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L4-->L812: Formula: (and (= 1 ~a~0_Out989802736) (= ~z$r_buff1_thd2~0_Out989802736 ~z$r_buff0_thd2~0_In989802736) (= ~z$r_buff1_thd4~0_Out989802736 ~z$r_buff0_thd4~0_In989802736) (= ~z$r_buff0_thd1~0_In989802736 ~z$r_buff1_thd1~0_Out989802736) (= ~__unbuffered_p3_EBX~0_Out989802736 ~b~0_In989802736) (= ~z$r_buff0_thd3~0_In989802736 ~z$r_buff1_thd3~0_Out989802736) (not (= 0 P3Thread1of1ForFork3___VERIFIER_assert_~expression_In989802736)) (= ~z$r_buff0_thd0~0_In989802736 ~z$r_buff1_thd0~0_Out989802736) (= ~__unbuffered_p3_EAX~0_Out989802736 ~a~0_Out989802736) (= ~z$r_buff0_thd4~0_Out989802736 1)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In989802736, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In989802736, ~b~0=~b~0_In989802736, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In989802736, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In989802736, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In989802736, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In989802736} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In989802736, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out989802736, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out989802736, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out989802736, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out989802736, ~a~0=~a~0_Out989802736, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In989802736, ~b~0=~b~0_In989802736, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out989802736, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out989802736, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out989802736, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out989802736, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In989802736, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In989802736, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In989802736} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-18 17:30:38,375 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_20 |v_P0Thread1of1ForFork0_#in~arg.base_20|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_P0Thread1of1ForFork0_~arg.offset_20 |v_P0Thread1of1ForFork0_#in~arg.offset_20|) (= v_~x~0_33 v_~__unbuffered_p0_EAX~0_26) (= v_~b~0_72 1) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_20|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, ~x~0=v_~x~0_33} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_20|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~b~0=v_~b~0_72, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_20|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_20, ~x~0=v_~x~0_33, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_20} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 17:30:38,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= v_~y~0_25 v_~__unbuffered_p1_EAX~0_14) (= |v_P1Thread1of1ForFork1_#in~arg.offset_10| v_P1Thread1of1ForFork1_~arg.offset_10) (= v_~x~0_18 1) (= v_P1Thread1of1ForFork1_~arg.base_10 |v_P1Thread1of1ForFork1_#in~arg.base_10|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_10|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~y~0=v_~y~0_25} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_10, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_10, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_10|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, ~y~0=v_~y~0_25, ~x~0=v_~x~0_18, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 17:30:38,378 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In591666747 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In591666747 256)))) (or (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork3_#t~ite11_Out591666747| 0)) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork3_#t~ite11_Out591666747| ~z$w_buff0_used~0_In591666747)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In591666747, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In591666747} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In591666747, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In591666747, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out591666747|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-18 17:30:38,379 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L776-2-->L776-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In36500962 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In36500962 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite3_Out36500962| ~z$w_buff1~0_In36500962) (not .cse0) (not .cse1)) (and (= ~z~0_In36500962 |P2Thread1of1ForFork2_#t~ite3_Out36500962|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In36500962, ~z$w_buff1_used~0=~z$w_buff1_used~0_In36500962, ~z$w_buff1~0=~z$w_buff1~0_In36500962, ~z~0=~z~0_In36500962} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out36500962|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In36500962, ~z$w_buff1_used~0=~z$w_buff1_used~0_In36500962, ~z$w_buff1~0=~z$w_buff1~0_In36500962, ~z~0=~z~0_In36500962} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 17:30:38,379 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L776-4-->L777: Formula: (= v_~z~0_18 |v_P2Thread1of1ForFork2_#t~ite3_8|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_8|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_9|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_7|, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-18 17:30:38,379 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In614659061 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In614659061 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite5_Out614659061| 0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite5_Out614659061| ~z$w_buff0_used~0_In614659061) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In614659061, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In614659061} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out614659061|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In614659061, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In614659061} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 17:30:38,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L778-->L778-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-39389912 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-39389912 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-39389912 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-39389912 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-39389912 |P2Thread1of1ForFork2_#t~ite6_Out-39389912|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite6_Out-39389912|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-39389912, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-39389912, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-39389912, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-39389912} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-39389912|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-39389912, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-39389912, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-39389912, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-39389912} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 17:30:38,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1782584720 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1782584720 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite7_Out1782584720|)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite7_Out1782584720| ~z$r_buff0_thd3~0_In1782584720)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1782584720, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1782584720} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1782584720, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1782584720, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out1782584720|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 17:30:38,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L780-->L780-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-326641769 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-326641769 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-326641769 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-326641769 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite8_Out-326641769| 0)) (and (= |P2Thread1of1ForFork2_#t~ite8_Out-326641769| ~z$r_buff1_thd3~0_In-326641769) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-326641769, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-326641769, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-326641769, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-326641769} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-326641769, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-326641769, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-326641769, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-326641769, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out-326641769|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 17:30:38,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L780-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite8_44| v_~z$r_buff1_thd3~0_114) (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_83 1) v_~__unbuffered_cnt~0_82)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_44|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_114, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_43|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 17:30:38,383 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L814-->L814-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In615474156 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In615474156 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In615474156 256))) (.cse1 (= (mod ~z$r_buff1_thd4~0_In615474156 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In615474156 |P3Thread1of1ForFork3_#t~ite12_Out615474156|)) (and (= |P3Thread1of1ForFork3_#t~ite12_Out615474156| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In615474156, ~z$w_buff0_used~0=~z$w_buff0_used~0_In615474156, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In615474156, ~z$w_buff1_used~0=~z$w_buff1_used~0_In615474156} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In615474156, ~z$w_buff0_used~0=~z$w_buff0_used~0_In615474156, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In615474156, ~z$w_buff1_used~0=~z$w_buff1_used~0_In615474156, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out615474156|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-18 17:30:38,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L815-->L816: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In724437464 256))) (.cse1 (= (mod ~z$r_buff0_thd4~0_In724437464 256) 0))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out724437464) (not .cse1)) (and (= ~z$r_buff0_thd4~0_Out724437464 ~z$r_buff0_thd4~0_In724437464) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In724437464, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In724437464} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In724437464, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out724437464, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out724437464|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-18 17:30:38,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L816-->L816-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd4~0_In1222047222 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1222047222 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1222047222 256))) (.cse3 (= (mod ~z$r_buff0_thd4~0_In1222047222 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork3_#t~ite14_Out1222047222| ~z$r_buff1_thd4~0_In1222047222)) (and (= |P3Thread1of1ForFork3_#t~ite14_Out1222047222| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1222047222, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1222047222, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1222047222, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1222047222} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1222047222, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1222047222, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out1222047222|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1222047222, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1222047222} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-18 17:30:38,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L816-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_106 (+ v_~__unbuffered_cnt~0_107 1)) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|) (= |v_P3Thread1of1ForFork3_#t~ite14_48| v_~z$r_buff1_thd4~0_102)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_48|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_102, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_47|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 17:30:38,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L845-->L847-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_79 256)) (= (mod v_~z$r_buff0_thd0~0_53 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_53, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_53, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 17:30:38,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L847-2-->L847-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite20_Out-883588073| |ULTIMATE.start_main_#t~ite19_Out-883588073|)) (.cse1 (= (mod ~z$w_buff1_used~0_In-883588073 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-883588073 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite19_Out-883588073| ~z~0_In-883588073) .cse2) (and (= |ULTIMATE.start_main_#t~ite19_Out-883588073| ~z$w_buff1~0_In-883588073) .cse2 (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-883588073, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-883588073, ~z$w_buff1~0=~z$w_buff1~0_In-883588073, ~z~0=~z~0_In-883588073} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-883588073|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-883588073, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-883588073, ~z$w_buff1~0=~z$w_buff1~0_In-883588073, ~z~0=~z~0_In-883588073, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-883588073|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 17:30:38,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L848-->L848-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1294500455 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1294500455 256)))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out-1294500455| ~z$w_buff0_used~0_In-1294500455) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-1294500455| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1294500455, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1294500455} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1294500455, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1294500455, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1294500455|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 17:30:38,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L849-->L849-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-519872282 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-519872282 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-519872282 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-519872282 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-519872282 |ULTIMATE.start_main_#t~ite22_Out-519872282|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out-519872282| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-519872282, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-519872282, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-519872282, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-519872282} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-519872282, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-519872282, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-519872282, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-519872282, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-519872282|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 17:30:38,389 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L850-->L850-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In728891323 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In728891323 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite23_Out728891323| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite23_Out728891323| ~z$r_buff0_thd0~0_In728891323)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In728891323, ~z$w_buff0_used~0=~z$w_buff0_used~0_In728891323} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In728891323, ~z$w_buff0_used~0=~z$w_buff0_used~0_In728891323, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out728891323|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 17:30:38,390 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L851-->L851-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd0~0_In961786471 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In961786471 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In961786471 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In961786471 256)))) (or (and (= |ULTIMATE.start_main_#t~ite24_Out961786471| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite24_Out961786471| ~z$r_buff1_thd0~0_In961786471) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In961786471, ~z$w_buff0_used~0=~z$w_buff0_used~0_In961786471, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In961786471, ~z$w_buff1_used~0=~z$w_buff1_used~0_In961786471} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In961786471, ~z$w_buff0_used~0=~z$w_buff0_used~0_In961786471, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In961786471, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out961786471|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In961786471} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 17:30:38,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L861-->L861-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1178426217 256)))) (or (and (= ~z$w_buff0_used~0_In-1178426217 |ULTIMATE.start_main_#t~ite37_Out-1178426217|) (= |ULTIMATE.start_main_#t~ite36_In-1178426217| |ULTIMATE.start_main_#t~ite36_Out-1178426217|) (not .cse0)) (and .cse0 (= |ULTIMATE.start_main_#t~ite37_Out-1178426217| |ULTIMATE.start_main_#t~ite36_Out-1178426217|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1178426217 256)))) (or (and (= 0 (mod ~z$r_buff1_thd0~0_In-1178426217 256)) .cse1) (and (= (mod ~z$w_buff1_used~0_In-1178426217 256) 0) .cse1) (= (mod ~z$w_buff0_used~0_In-1178426217 256) 0))) (= ~z$w_buff0_used~0_In-1178426217 |ULTIMATE.start_main_#t~ite36_Out-1178426217|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1178426217, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1178426217, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1178426217, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1178426217, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_In-1178426217|, ~weak$$choice2~0=~weak$$choice2~0_In-1178426217} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1178426217, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1178426217, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1178426217, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1178426217, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1178426217|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1178426217|, ~weak$$choice2~0=~weak$$choice2~0_In-1178426217} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 17:30:38,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L862-->L862-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1039634544 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-1039634544| ~z$w_buff1_used~0_In-1039634544) (not .cse0) (= |ULTIMATE.start_main_#t~ite39_In-1039634544| |ULTIMATE.start_main_#t~ite39_Out-1039634544|)) (and .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1039634544 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In-1039634544 256)) (and (= 0 (mod ~z$r_buff1_thd0~0_In-1039634544 256)) .cse1) (and (= 0 (mod ~z$w_buff1_used~0_In-1039634544 256)) .cse1))) (= |ULTIMATE.start_main_#t~ite39_Out-1039634544| ~z$w_buff1_used~0_In-1039634544) (= |ULTIMATE.start_main_#t~ite39_Out-1039634544| |ULTIMATE.start_main_#t~ite40_Out-1039634544|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1039634544, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1039634544, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In-1039634544|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1039634544, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1039634544, ~weak$$choice2~0=~weak$$choice2~0_In-1039634544} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1039634544, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1039634544|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1039634544|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1039634544, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1039634544, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1039634544, ~weak$$choice2~0=~weak$$choice2~0_In-1039634544} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 17:30:38,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L863-->L864: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_24 256))) (= v_~z$r_buff0_thd0~0_79 v_~z$r_buff0_thd0~0_80)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_80, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_79, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_8|, ~weak$$choice2~0=v_~weak$$choice2~0_24, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 17:30:38,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L866-->L4: Formula: (and (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (not (= (mod v_~z$flush_delayed~0_29 256) 0)) (= v_~z$mem_tmp~0_15 v_~z~0_103) (= 0 v_~z$flush_delayed~0_28)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_29} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_15, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_23|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_28, ~z~0=v_~z~0_103, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:30:38,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 17:30:38,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:30:38 BasicIcfg [2019-12-18 17:30:38,485 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:30:38,487 INFO L168 Benchmark]: Toolchain (without parser) took 88920.95 ms. Allocated memory was 146.3 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 102.0 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 17:30:38,488 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 17:30:38,488 INFO L168 Benchmark]: CACSL2BoogieTranslator took 809.43 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.6 MB in the beginning and 156.8 MB in the end (delta: -55.2 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-18 17:30:38,489 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.57 ms. Allocated memory is still 203.9 MB. Free memory was 156.8 MB in the beginning and 153.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-18 17:30:38,489 INFO L168 Benchmark]: Boogie Preprocessor took 40.27 ms. Allocated memory is still 203.9 MB. Free memory was 153.5 MB in the beginning and 151.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 17:30:38,490 INFO L168 Benchmark]: RCFGBuilder took 875.23 ms. Allocated memory is still 203.9 MB. Free memory was 151.6 MB in the beginning and 101.7 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. [2019-12-18 17:30:38,491 INFO L168 Benchmark]: TraceAbstraction took 87120.11 ms. Allocated memory was 203.9 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 101.7 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 996.2 MB. Max. memory is 7.1 GB. [2019-12-18 17:30:38,494 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.22 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 809.43 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.6 MB in the beginning and 156.8 MB in the end (delta: -55.2 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.57 ms. Allocated memory is still 203.9 MB. Free memory was 156.8 MB in the beginning and 153.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.27 ms. Allocated memory is still 203.9 MB. Free memory was 153.5 MB in the beginning and 151.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 875.23 ms. Allocated memory is still 203.9 MB. Free memory was 151.6 MB in the beginning and 101.7 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 87120.11 ms. Allocated memory was 203.9 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 101.7 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 996.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 182 ProgramPointsBefore, 90 ProgramPointsAfterwards, 210 TransitionsBefore, 97 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 26 ChoiceCompositions, 4720 VarBasedMoverChecksPositive, 197 VarBasedMoverChecksNegative, 35 SemBasedMoverChecksPositive, 226 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 56592 CheckedPairsTotal, 126 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t1157, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L837] FCALL, FORK 0 pthread_create(&t1158, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L839] FCALL, FORK 0 pthread_create(&t1159, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L841] FCALL, FORK 0 pthread_create(&t1160, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L790] 4 z$w_buff1 = z$w_buff0 [L791] 4 z$w_buff0 = 2 [L792] 4 z$w_buff1_used = z$w_buff0_used [L793] 4 z$w_buff0_used = (_Bool)1 [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 1 [L773] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L776] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L778] 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 [L779] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 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) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 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 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 86.8s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 22.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3213 SDtfs, 4175 SDslu, 10196 SDs, 0 SdLazy, 4418 SolverSat, 332 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 257 GetRequests, 23 SyntacticMatches, 16 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93605occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 51.9s AutomataMinimizationTime, 23 MinimizatonAttempts, 184714 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 940 NumberOfCodeBlocks, 940 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 857 ConstructedInterpolants, 0 QuantifiedInterpolants, 181046 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...