/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix043_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:33:20,234 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:33:20,236 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:33:20,248 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:33:20,248 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:33:20,249 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:33:20,250 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:33:20,252 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:33:20,254 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:33:20,255 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:33:20,256 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:33:20,259 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:33:20,260 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:33:20,261 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:33:20,262 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:33:20,263 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:33:20,263 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:33:20,264 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:33:20,266 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:33:20,268 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:33:20,270 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:33:20,271 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:33:20,272 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:33:20,273 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:33:20,276 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:33:20,276 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:33:20,276 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:33:20,277 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:33:20,278 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:33:20,279 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:33:20,279 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:33:20,280 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:33:20,280 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:33:20,281 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:33:20,282 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:33:20,282 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:33:20,283 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:33:20,283 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:33:20,284 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:33:20,284 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:33:20,285 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:33:20,286 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:33:20,312 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:33:20,312 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:33:20,313 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:33:20,314 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:33:20,314 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:33:20,314 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:33:20,314 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:33:20,315 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:33:20,315 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:33:20,315 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:33:20,315 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:33:20,315 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:33:20,316 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:33:20,316 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:33:20,316 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:33:20,316 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:33:20,316 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:33:20,317 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:33:20,317 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:33:20,317 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:33:20,317 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:33:20,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:33:20,318 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:33:20,318 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:33:20,318 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:33:20,318 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:33:20,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:33:20,319 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:33:20,319 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:33:20,319 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:33:20,581 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:33:20,599 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:33:20,603 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:33:20,605 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:33:20,605 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:33:20,606 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 13:33:20,681 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3385b7268/de065636f9b3434c8f587b7f9f08aecb/FLAGa99a616fd [2019-12-18 13:33:21,277 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:33:21,280 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043_tso.opt.i [2019-12-18 13:33:21,296 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3385b7268/de065636f9b3434c8f587b7f9f08aecb/FLAGa99a616fd [2019-12-18 13:33:21,582 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3385b7268/de065636f9b3434c8f587b7f9f08aecb [2019-12-18 13:33:21,590 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:33:21,592 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:33:21,593 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:33:21,593 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:33:21,599 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:33:21,600 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:33:21" (1/1) ... [2019-12-18 13:33:21,602 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c13ccee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:21, skipping insertion in model container [2019-12-18 13:33:21,603 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:33:21" (1/1) ... [2019-12-18 13:33:21,610 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:33:21,676 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:33:22,209 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:33:22,227 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:33:22,318 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:33:22,392 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:33:22,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:22 WrapperNode [2019-12-18 13:33:22,393 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:33:22,393 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:33:22,394 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:33:22,394 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:33:22,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:22" (1/1) ... [2019-12-18 13:33:22,421 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:22" (1/1) ... [2019-12-18 13:33:22,457 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:33:22,457 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:33:22,457 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:33:22,458 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:33:22,465 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:22" (1/1) ... [2019-12-18 13:33:22,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:22" (1/1) ... [2019-12-18 13:33:22,471 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:22" (1/1) ... [2019-12-18 13:33:22,471 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:22" (1/1) ... [2019-12-18 13:33:22,482 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:22" (1/1) ... [2019-12-18 13:33:22,486 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:22" (1/1) ... [2019-12-18 13:33:22,490 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:22" (1/1) ... [2019-12-18 13:33:22,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:33:22,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:33:22,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:33:22,496 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:33:22,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:33:22,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:33:22,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:33:22,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:33:22,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:33:22,571 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:33:22,571 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:33:22,571 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:33:22,572 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:33:22,572 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:33:22,572 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:33:22,572 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 13:33:22,572 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 13:33:22,572 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:33:22,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:33:22,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:33:22,575 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 13:33:23,311 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:33:23,312 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:33:23,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:33:23 BoogieIcfgContainer [2019-12-18 13:33:23,313 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:33:23,315 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:33:23,315 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:33:23,318 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:33:23,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:33:21" (1/3) ... [2019-12-18 13:33:23,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a815ac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:33:23, skipping insertion in model container [2019-12-18 13:33:23,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:22" (2/3) ... [2019-12-18 13:33:23,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a815ac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:33:23, skipping insertion in model container [2019-12-18 13:33:23,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:33:23" (3/3) ... [2019-12-18 13:33:23,322 INFO L109 eAbstractionObserver]: Analyzing ICFG mix043_tso.opt.i [2019-12-18 13:33:23,332 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:33:23,333 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:33:23,340 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:33:23,342 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:33:23,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,385 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,386 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,389 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,389 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,391 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,391 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,404 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,404 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,405 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,405 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,405 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,405 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,406 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,421 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,423 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,423 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,423 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,424 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,424 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,424 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,425 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,425 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,425 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,425 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,426 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,426 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,426 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,426 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,427 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,427 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,427 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,427 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,428 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,428 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,428 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,428 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,429 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,429 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,429 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,430 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,435 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,435 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,438 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,439 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,442 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,442 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,445 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,446 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,446 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,446 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,447 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,447 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,447 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,447 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,447 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,448 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,448 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,448 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:33:23,464 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 13:33:23,485 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:33:23,485 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:33:23,485 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:33:23,485 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:33:23,485 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:33:23,485 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:33:23,485 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:33:23,486 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:33:23,503 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 210 transitions [2019-12-18 13:33:23,505 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-18 13:33:23,594 INFO L126 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-18 13:33:23,595 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:33:23,610 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 13:33:23,631 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-18 13:33:23,681 INFO L126 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-18 13:33:23,682 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:33:23,689 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 13:33:23,706 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-18 13:33:23,707 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:33:27,014 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2019-12-18 13:33:28,842 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-12-18 13:33:29,227 WARN L192 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-18 13:33:29,370 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-18 13:33:29,390 INFO L206 etLargeBlockEncoding]: Checked pairs total: 56592 [2019-12-18 13:33:29,390 INFO L214 etLargeBlockEncoding]: Total number of compositions: 126 [2019-12-18 13:33:29,394 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 97 transitions [2019-12-18 13:33:31,808 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 33838 states. [2019-12-18 13:33:31,810 INFO L276 IsEmpty]: Start isEmpty. Operand 33838 states. [2019-12-18 13:33:31,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 13:33:31,817 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:33:31,817 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:33:31,818 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 13:33:31,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:33:31,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1752766824, now seen corresponding path program 1 times [2019-12-18 13:33:31,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:33:31,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518481206] [2019-12-18 13:33:31,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:33:32,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:33:32,701 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 13:33:32,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518481206] [2019-12-18 13:33:32,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:33:32,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:33:32,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043794147] [2019-12-18 13:33:32,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:33:32,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:33:32,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:33:32,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:33:32,721 INFO L87 Difference]: Start difference. First operand 33838 states. Second operand 3 states. [2019-12-18 13:33:33,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:33:33,284 INFO L93 Difference]: Finished difference Result 33638 states and 143712 transitions. [2019-12-18 13:33:33,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:33:33,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 13:33:33,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:33:33,550 INFO L225 Difference]: With dead ends: 33638 [2019-12-18 13:33:33,551 INFO L226 Difference]: Without dead ends: 32966 [2019-12-18 13:33:33,552 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 13:33:34,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32966 states. [2019-12-18 13:33:35,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32966 to 32966. [2019-12-18 13:33:35,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32966 states. [2019-12-18 13:33:35,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32966 states to 32966 states and 140968 transitions. [2019-12-18 13:33:35,678 INFO L78 Accepts]: Start accepts. Automaton has 32966 states and 140968 transitions. Word has length 9 [2019-12-18 13:33:35,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:33:35,679 INFO L462 AbstractCegarLoop]: Abstraction has 32966 states and 140968 transitions. [2019-12-18 13:33:35,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:33:35,679 INFO L276 IsEmpty]: Start isEmpty. Operand 32966 states and 140968 transitions. [2019-12-18 13:33:35,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 13:33:35,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:33:35,686 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:33:35,687 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 13:33:35,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:33:35,687 INFO L82 PathProgramCache]: Analyzing trace with hash -666575947, now seen corresponding path program 1 times [2019-12-18 13:33:35,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:33:35,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868974278] [2019-12-18 13:33:35,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:33:35,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:33:35,814 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 13:33:35,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868974278] [2019-12-18 13:33:35,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:33:35,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:33:35,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88755975] [2019-12-18 13:33:35,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:33:35,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:33:35,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:33:35,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:33:35,818 INFO L87 Difference]: Start difference. First operand 32966 states and 140968 transitions. Second operand 4 states. [2019-12-18 13:33:38,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:33:38,098 INFO L93 Difference]: Finished difference Result 44494 states and 185824 transitions. [2019-12-18 13:33:38,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:33:38,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 13:33:38,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:33:38,323 INFO L225 Difference]: With dead ends: 44494 [2019-12-18 13:33:38,324 INFO L226 Difference]: Without dead ends: 44494 [2019-12-18 13:33:38,326 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 13:33:38,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44494 states. [2019-12-18 13:33:39,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44494 to 43986. [2019-12-18 13:33:39,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43986 states. [2019-12-18 13:33:42,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43986 states to 43986 states and 183912 transitions. [2019-12-18 13:33:42,227 INFO L78 Accepts]: Start accepts. Automaton has 43986 states and 183912 transitions. Word has length 15 [2019-12-18 13:33:42,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:33:42,227 INFO L462 AbstractCegarLoop]: Abstraction has 43986 states and 183912 transitions. [2019-12-18 13:33:42,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:33:42,228 INFO L276 IsEmpty]: Start isEmpty. Operand 43986 states and 183912 transitions. [2019-12-18 13:33:42,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 13:33:42,231 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:33:42,231 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:33:42,231 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 13:33:42,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:33:42,232 INFO L82 PathProgramCache]: Analyzing trace with hash 703479247, now seen corresponding path program 1 times [2019-12-18 13:33:42,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:33:42,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472209644] [2019-12-18 13:33:42,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:33:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:33:42,318 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 13:33:42,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472209644] [2019-12-18 13:33:42,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:33:42,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:33:42,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779507879] [2019-12-18 13:33:42,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:33:42,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:33:42,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:33:42,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:33:42,324 INFO L87 Difference]: Start difference. First operand 43986 states and 183912 transitions. Second operand 4 states. [2019-12-18 13:33:42,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:33:42,877 INFO L93 Difference]: Finished difference Result 62082 states and 254960 transitions. [2019-12-18 13:33:42,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:33:42,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 13:33:42,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:33:43,243 INFO L225 Difference]: With dead ends: 62082 [2019-12-18 13:33:43,243 INFO L226 Difference]: Without dead ends: 62054 [2019-12-18 13:33:43,244 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 13:33:44,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62054 states. [2019-12-18 13:33:45,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62054 to 51774. [2019-12-18 13:33:45,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51774 states. [2019-12-18 13:33:45,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51774 states to 51774 states and 215576 transitions. [2019-12-18 13:33:45,481 INFO L78 Accepts]: Start accepts. Automaton has 51774 states and 215576 transitions. Word has length 15 [2019-12-18 13:33:45,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:33:45,482 INFO L462 AbstractCegarLoop]: Abstraction has 51774 states and 215576 transitions. [2019-12-18 13:33:45,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:33:45,482 INFO L276 IsEmpty]: Start isEmpty. Operand 51774 states and 215576 transitions. [2019-12-18 13:33:45,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 13:33:45,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:33:45,498 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:33:45,498 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 13:33:45,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:33:45,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1831569488, now seen corresponding path program 1 times [2019-12-18 13:33:45,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:33:45,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544523239] [2019-12-18 13:33:45,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:33:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:33:45,583 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 13:33:45,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544523239] [2019-12-18 13:33:45,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:33:45,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:33:45,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602522816] [2019-12-18 13:33:45,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:33:45,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:33:45,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:33:45,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:33:45,585 INFO L87 Difference]: Start difference. First operand 51774 states and 215576 transitions. Second operand 5 states. [2019-12-18 13:33:46,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:33:46,719 INFO L93 Difference]: Finished difference Result 68854 states and 281988 transitions. [2019-12-18 13:33:46,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:33:46,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-18 13:33:46,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:33:46,938 INFO L225 Difference]: With dead ends: 68854 [2019-12-18 13:33:46,938 INFO L226 Difference]: Without dead ends: 68826 [2019-12-18 13:33:46,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 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 13:33:47,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68826 states. [2019-12-18 13:33:50,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68826 to 51450. [2019-12-18 13:33:50,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51450 states. [2019-12-18 13:33:51,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51450 states to 51450 states and 213896 transitions. [2019-12-18 13:33:51,189 INFO L78 Accepts]: Start accepts. Automaton has 51450 states and 213896 transitions. Word has length 21 [2019-12-18 13:33:51,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:33:51,189 INFO L462 AbstractCegarLoop]: Abstraction has 51450 states and 213896 transitions. [2019-12-18 13:33:51,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:33:51,189 INFO L276 IsEmpty]: Start isEmpty. Operand 51450 states and 213896 transitions. [2019-12-18 13:33:51,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 13:33:51,250 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:33:51,251 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 13:33:51,251 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 13:33:51,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:33:51,251 INFO L82 PathProgramCache]: Analyzing trace with hash 2027885083, now seen corresponding path program 1 times [2019-12-18 13:33:51,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:33:51,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961017560] [2019-12-18 13:33:51,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:33:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:33:51,332 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 13:33:51,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961017560] [2019-12-18 13:33:51,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:33:51,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:33:51,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832561158] [2019-12-18 13:33:51,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:33:51,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:33:51,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:33:51,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:33:51,334 INFO L87 Difference]: Start difference. First operand 51450 states and 213896 transitions. Second operand 3 states. [2019-12-18 13:33:51,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:33:51,697 INFO L93 Difference]: Finished difference Result 64130 states and 263832 transitions. [2019-12-18 13:33:51,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:33:51,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-18 13:33:51,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:33:51,851 INFO L225 Difference]: With dead ends: 64130 [2019-12-18 13:33:51,851 INFO L226 Difference]: Without dead ends: 64130 [2019-12-18 13:33:51,852 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 13:33:52,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64130 states. [2019-12-18 13:33:55,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64130 to 56646. [2019-12-18 13:33:55,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56646 states. [2019-12-18 13:33:55,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56646 states to 56646 states and 234808 transitions. [2019-12-18 13:33:55,536 INFO L78 Accepts]: Start accepts. Automaton has 56646 states and 234808 transitions. Word has length 29 [2019-12-18 13:33:55,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:33:55,536 INFO L462 AbstractCegarLoop]: Abstraction has 56646 states and 234808 transitions. [2019-12-18 13:33:55,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:33:55,536 INFO L276 IsEmpty]: Start isEmpty. Operand 56646 states and 234808 transitions. [2019-12-18 13:33:55,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 13:33:55,573 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:33:55,574 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 13:33:55,574 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 13:33:55,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:33:55,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1811393886, now seen corresponding path program 1 times [2019-12-18 13:33:55,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:33:55,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215465000] [2019-12-18 13:33:55,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:33:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:33:55,656 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 13:33:55,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215465000] [2019-12-18 13:33:55,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:33:55,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:33:55,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998012227] [2019-12-18 13:33:55,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:33:55,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:33:55,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:33:55,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:33:55,658 INFO L87 Difference]: Start difference. First operand 56646 states and 234808 transitions. Second operand 6 states. [2019-12-18 13:33:56,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:33:56,804 INFO L93 Difference]: Finished difference Result 81602 states and 332376 transitions. [2019-12-18 13:33:56,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:33:56,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-18 13:33:56,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:33:57,019 INFO L225 Difference]: With dead ends: 81602 [2019-12-18 13:33:57,019 INFO L226 Difference]: Without dead ends: 81538 [2019-12-18 13:33:57,019 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 13:33:57,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81538 states. [2019-12-18 13:34:01,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81538 to 65578. [2019-12-18 13:34:01,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65578 states. [2019-12-18 13:34:01,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65578 states to 65578 states and 270440 transitions. [2019-12-18 13:34:01,295 INFO L78 Accepts]: Start accepts. Automaton has 65578 states and 270440 transitions. Word has length 29 [2019-12-18 13:34:01,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:34:01,296 INFO L462 AbstractCegarLoop]: Abstraction has 65578 states and 270440 transitions. [2019-12-18 13:34:01,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:34:01,296 INFO L276 IsEmpty]: Start isEmpty. Operand 65578 states and 270440 transitions. [2019-12-18 13:34:01,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 13:34:01,369 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:34:01,369 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 13:34:01,369 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 13:34:01,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:34:01,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1048930675, now seen corresponding path program 1 times [2019-12-18 13:34:01,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:34:01,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766496577] [2019-12-18 13:34:01,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:34:01,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:34:01,469 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 13:34:01,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766496577] [2019-12-18 13:34:01,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:34:01,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:34:01,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824595383] [2019-12-18 13:34:01,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:34:01,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:34:01,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:34:01,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:34:01,472 INFO L87 Difference]: Start difference. First operand 65578 states and 270440 transitions. Second operand 3 states. [2019-12-18 13:34:02,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:34:02,392 INFO L93 Difference]: Finished difference Result 65578 states and 269720 transitions. [2019-12-18 13:34:02,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:34:02,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-12-18 13:34:02,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:34:02,568 INFO L225 Difference]: With dead ends: 65578 [2019-12-18 13:34:02,568 INFO L226 Difference]: Without dead ends: 65578 [2019-12-18 13:34:02,569 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 13:34:02,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65578 states. [2019-12-18 13:34:07,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65578 to 65578. [2019-12-18 13:34:07,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65578 states. [2019-12-18 13:34:07,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65578 states to 65578 states and 269720 transitions. [2019-12-18 13:34:07,294 INFO L78 Accepts]: Start accepts. Automaton has 65578 states and 269720 transitions. Word has length 35 [2019-12-18 13:34:07,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:34:07,295 INFO L462 AbstractCegarLoop]: Abstraction has 65578 states and 269720 transitions. [2019-12-18 13:34:07,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:34:07,295 INFO L276 IsEmpty]: Start isEmpty. Operand 65578 states and 269720 transitions. [2019-12-18 13:34:07,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 13:34:07,353 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:34:07,353 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 13:34:07,353 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 13:34:07,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:34:07,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1735231015, now seen corresponding path program 1 times [2019-12-18 13:34:07,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:34:07,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761791750] [2019-12-18 13:34:07,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:34:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:34:07,452 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 13:34:07,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761791750] [2019-12-18 13:34:07,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:34:07,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:34:07,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057768729] [2019-12-18 13:34:07,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:34:07,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:34:07,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:34:07,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:34:07,454 INFO L87 Difference]: Start difference. First operand 65578 states and 269720 transitions. Second operand 7 states. [2019-12-18 13:34:08,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:34:08,776 INFO L93 Difference]: Finished difference Result 89414 states and 361616 transitions. [2019-12-18 13:34:08,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 13:34:08,777 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-18 13:34:08,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:34:09,071 INFO L225 Difference]: With dead ends: 89414 [2019-12-18 13:34:09,072 INFO L226 Difference]: Without dead ends: 89310 [2019-12-18 13:34:09,072 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 13:34:09,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89310 states. [2019-12-18 13:34:10,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89310 to 58886. [2019-12-18 13:34:10,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58886 states. [2019-12-18 13:34:11,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58886 states to 58886 states and 243296 transitions. [2019-12-18 13:34:11,015 INFO L78 Accepts]: Start accepts. Automaton has 58886 states and 243296 transitions. Word has length 35 [2019-12-18 13:34:11,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:34:11,015 INFO L462 AbstractCegarLoop]: Abstraction has 58886 states and 243296 transitions. [2019-12-18 13:34:11,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:34:11,015 INFO L276 IsEmpty]: Start isEmpty. Operand 58886 states and 243296 transitions. [2019-12-18 13:34:11,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 13:34:11,081 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:34:11,081 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 13:34:11,082 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 13:34:11,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:34:11,082 INFO L82 PathProgramCache]: Analyzing trace with hash 903389864, now seen corresponding path program 1 times [2019-12-18 13:34:11,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:34:11,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385936290] [2019-12-18 13:34:11,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:34:11,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:34:11,141 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 13:34:11,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385936290] [2019-12-18 13:34:11,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:34:11,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:34:11,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194171802] [2019-12-18 13:34:11,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:34:11,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:34:11,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:34:11,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:34:11,143 INFO L87 Difference]: Start difference. First operand 58886 states and 243296 transitions. Second operand 4 states. [2019-12-18 13:34:12,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:34:12,033 INFO L93 Difference]: Finished difference Result 47360 states and 179978 transitions. [2019-12-18 13:34:12,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:34:12,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-18 13:34:12,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:34:12,136 INFO L225 Difference]: With dead ends: 47360 [2019-12-18 13:34:12,136 INFO L226 Difference]: Without dead ends: 46252 [2019-12-18 13:34:12,136 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 13:34:12,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46252 states. [2019-12-18 13:34:12,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46252 to 46252. [2019-12-18 13:34:12,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46252 states. [2019-12-18 13:34:12,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46252 states to 46252 states and 176502 transitions. [2019-12-18 13:34:12,984 INFO L78 Accepts]: Start accepts. Automaton has 46252 states and 176502 transitions. Word has length 35 [2019-12-18 13:34:12,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:34:12,985 INFO L462 AbstractCegarLoop]: Abstraction has 46252 states and 176502 transitions. [2019-12-18 13:34:12,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:34:12,985 INFO L276 IsEmpty]: Start isEmpty. Operand 46252 states and 176502 transitions. [2019-12-18 13:34:13,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-18 13:34:13,022 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:34:13,022 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] [2019-12-18 13:34:13,022 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 13:34:13,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:34:13,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1617947594, now seen corresponding path program 1 times [2019-12-18 13:34:13,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:34:13,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86103556] [2019-12-18 13:34:13,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:34:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:34:13,167 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 13:34:13,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86103556] [2019-12-18 13:34:13,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:34:13,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:34:13,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061961584] [2019-12-18 13:34:13,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:34:13,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:34:13,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:34:13,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:34:13,171 INFO L87 Difference]: Start difference. First operand 46252 states and 176502 transitions. Second operand 6 states. [2019-12-18 13:34:13,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:34:13,823 INFO L93 Difference]: Finished difference Result 58248 states and 224178 transitions. [2019-12-18 13:34:13,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 13:34:13,825 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-12-18 13:34:13,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:34:14,051 INFO L225 Difference]: With dead ends: 58248 [2019-12-18 13:34:14,787 INFO L226 Difference]: Without dead ends: 55647 [2019-12-18 13:34:14,788 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 13:34:15,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55647 states. [2019-12-18 13:34:15,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55647 to 51679. [2019-12-18 13:34:15,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51679 states. [2019-12-18 13:34:15,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51679 states to 51679 states and 198408 transitions. [2019-12-18 13:34:15,874 INFO L78 Accepts]: Start accepts. Automaton has 51679 states and 198408 transitions. Word has length 36 [2019-12-18 13:34:15,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:34:15,874 INFO L462 AbstractCegarLoop]: Abstraction has 51679 states and 198408 transitions. [2019-12-18 13:34:15,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:34:15,875 INFO L276 IsEmpty]: Start isEmpty. Operand 51679 states and 198408 transitions. [2019-12-18 13:34:15,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-18 13:34:15,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:34:15,924 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 13:34:15,924 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 13:34:15,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:34:15,924 INFO L82 PathProgramCache]: Analyzing trace with hash 859028932, now seen corresponding path program 1 times [2019-12-18 13:34:15,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:34:15,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438552092] [2019-12-18 13:34:15,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:34:15,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:34:16,011 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 13:34:16,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438552092] [2019-12-18 13:34:16,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:34:16,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:34:16,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904079293] [2019-12-18 13:34:16,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:34:16,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:34:16,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:34:16,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:34:16,014 INFO L87 Difference]: Start difference. First operand 51679 states and 198408 transitions. Second operand 5 states. [2019-12-18 13:34:16,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:34:16,152 INFO L93 Difference]: Finished difference Result 22140 states and 70370 transitions. [2019-12-18 13:34:16,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:34:16,152 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-12-18 13:34:16,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:34:16,193 INFO L225 Difference]: With dead ends: 22140 [2019-12-18 13:34:16,194 INFO L226 Difference]: Without dead ends: 21264 [2019-12-18 13:34:16,194 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 13:34:16,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21264 states. [2019-12-18 13:34:16,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21264 to 21264. [2019-12-18 13:34:16,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21264 states. [2019-12-18 13:34:16,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21264 states to 21264 states and 67572 transitions. [2019-12-18 13:34:16,875 INFO L78 Accepts]: Start accepts. Automaton has 21264 states and 67572 transitions. Word has length 38 [2019-12-18 13:34:16,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:34:16,875 INFO L462 AbstractCegarLoop]: Abstraction has 21264 states and 67572 transitions. [2019-12-18 13:34:16,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:34:16,875 INFO L276 IsEmpty]: Start isEmpty. Operand 21264 states and 67572 transitions. [2019-12-18 13:34:16,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 13:34:16,889 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:34:16,889 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 13:34:16,889 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 13:34:16,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:34:16,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1508152385, now seen corresponding path program 1 times [2019-12-18 13:34:16,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:34:16,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586400035] [2019-12-18 13:34:16,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:34:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:34:16,969 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 13:34:16,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586400035] [2019-12-18 13:34:16,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:34:16,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:34:16,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686960307] [2019-12-18 13:34:16,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:34:16,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:34:16,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:34:16,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:34:16,971 INFO L87 Difference]: Start difference. First operand 21264 states and 67572 transitions. Second operand 6 states. [2019-12-18 13:34:17,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:34:17,050 INFO L93 Difference]: Finished difference Result 3628 states and 9189 transitions. [2019-12-18 13:34:17,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:34:17,050 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-18 13:34:17,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:34:17,055 INFO L225 Difference]: With dead ends: 3628 [2019-12-18 13:34:17,056 INFO L226 Difference]: Without dead ends: 3259 [2019-12-18 13:34:17,056 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 13:34:17,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3259 states. [2019-12-18 13:34:17,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3259 to 3259. [2019-12-18 13:34:17,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3259 states. [2019-12-18 13:34:17,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3259 states to 3259 states and 8151 transitions. [2019-12-18 13:34:17,106 INFO L78 Accepts]: Start accepts. Automaton has 3259 states and 8151 transitions. Word has length 39 [2019-12-18 13:34:17,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:34:17,106 INFO L462 AbstractCegarLoop]: Abstraction has 3259 states and 8151 transitions. [2019-12-18 13:34:17,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:34:17,106 INFO L276 IsEmpty]: Start isEmpty. Operand 3259 states and 8151 transitions. [2019-12-18 13:34:17,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 13:34:17,110 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:34:17,111 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 13:34:17,111 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 13:34:17,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:34:17,111 INFO L82 PathProgramCache]: Analyzing trace with hash 210850107, now seen corresponding path program 1 times [2019-12-18 13:34:17,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:34:17,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624248906] [2019-12-18 13:34:17,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:34:17,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:34:17,267 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 13:34:17,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624248906] [2019-12-18 13:34:17,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:34:17,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:34:17,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774215813] [2019-12-18 13:34:17,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:34:17,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:34:17,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:34:17,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:34:17,271 INFO L87 Difference]: Start difference. First operand 3259 states and 8151 transitions. Second operand 7 states. [2019-12-18 13:34:17,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:34:17,397 INFO L93 Difference]: Finished difference Result 1347 states and 3757 transitions. [2019-12-18 13:34:17,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:34:17,398 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-18 13:34:17,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:34:17,402 INFO L225 Difference]: With dead ends: 1347 [2019-12-18 13:34:17,402 INFO L226 Difference]: Without dead ends: 1298 [2019-12-18 13:34:17,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:34:17,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2019-12-18 13:34:17,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1186. [2019-12-18 13:34:17,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2019-12-18 13:34:17,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 3341 transitions. [2019-12-18 13:34:17,430 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 3341 transitions. Word has length 48 [2019-12-18 13:34:17,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:34:17,430 INFO L462 AbstractCegarLoop]: Abstraction has 1186 states and 3341 transitions. [2019-12-18 13:34:17,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:34:17,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 3341 transitions. [2019-12-18 13:34:17,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 13:34:17,432 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:34:17,433 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 13:34:17,433 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 13:34:17,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:34:17,433 INFO L82 PathProgramCache]: Analyzing trace with hash -734644091, now seen corresponding path program 1 times [2019-12-18 13:34:17,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:34:17,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39495427] [2019-12-18 13:34:17,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:34:17,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:34:17,642 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 13:34:17,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39495427] [2019-12-18 13:34:17,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:34:17,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:34:17,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407410106] [2019-12-18 13:34:17,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:34:17,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:34:17,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:34:17,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:34:17,645 INFO L87 Difference]: Start difference. First operand 1186 states and 3341 transitions. Second operand 7 states. [2019-12-18 13:34:17,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:34:17,786 INFO L93 Difference]: Finished difference Result 1900 states and 5150 transitions. [2019-12-18 13:34:17,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 13:34:17,787 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-12-18 13:34:17,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:34:17,789 INFO L225 Difference]: With dead ends: 1900 [2019-12-18 13:34:17,789 INFO L226 Difference]: Without dead ends: 1247 [2019-12-18 13:34:17,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:34:17,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2019-12-18 13:34:17,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 1058. [2019-12-18 13:34:17,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1058 states. [2019-12-18 13:34:17,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 2908 transitions. [2019-12-18 13:34:17,808 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 2908 transitions. Word has length 59 [2019-12-18 13:34:17,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:34:17,808 INFO L462 AbstractCegarLoop]: Abstraction has 1058 states and 2908 transitions. [2019-12-18 13:34:17,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:34:17,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 2908 transitions. [2019-12-18 13:34:17,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 13:34:17,810 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:34:17,811 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 13:34:17,811 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 13:34:17,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:34:17,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1193491105, now seen corresponding path program 2 times [2019-12-18 13:34:17,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:34:17,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861991063] [2019-12-18 13:34:17,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:34:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:34:17,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:34:17,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861991063] [2019-12-18 13:34:17,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:34:17,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:34:17,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939260125] [2019-12-18 13:34:17,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:34:17,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:34:17,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:34:17,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:34:17,989 INFO L87 Difference]: Start difference. First operand 1058 states and 2908 transitions. Second operand 7 states. [2019-12-18 13:34:18,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:34:18,119 INFO L93 Difference]: Finished difference Result 1768 states and 4665 transitions. [2019-12-18 13:34:18,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 13:34:18,120 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-12-18 13:34:18,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:34:18,121 INFO L225 Difference]: With dead ends: 1768 [2019-12-18 13:34:18,121 INFO L226 Difference]: Without dead ends: 683 [2019-12-18 13:34:18,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:34:18,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-12-18 13:34:18,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 595. [2019-12-18 13:34:18,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-12-18 13:34:18,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 1322 transitions. [2019-12-18 13:34:18,130 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 1322 transitions. Word has length 59 [2019-12-18 13:34:18,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:34:18,131 INFO L462 AbstractCegarLoop]: Abstraction has 595 states and 1322 transitions. [2019-12-18 13:34:18,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:34:18,131 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 1322 transitions. [2019-12-18 13:34:18,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 13:34:18,132 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:34:18,132 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:34:18,132 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 13:34:18,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:34:18,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1632162753, now seen corresponding path program 3 times [2019-12-18 13:34:18,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:34:18,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563397792] [2019-12-18 13:34:18,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:34:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:34:18,193 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 13:34:18,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563397792] [2019-12-18 13:34:18,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:34:18,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:34:18,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760152704] [2019-12-18 13:34:18,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:34:18,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:34:18,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:34:18,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:34:18,195 INFO L87 Difference]: Start difference. First operand 595 states and 1322 transitions. Second operand 3 states. [2019-12-18 13:34:18,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:34:18,209 INFO L93 Difference]: Finished difference Result 572 states and 1242 transitions. [2019-12-18 13:34:18,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:34:18,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 13:34:18,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:34:18,211 INFO L225 Difference]: With dead ends: 572 [2019-12-18 13:34:18,211 INFO L226 Difference]: Without dead ends: 572 [2019-12-18 13:34:18,211 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 13:34:18,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-12-18 13:34:18,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2019-12-18 13:34:18,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2019-12-18 13:34:18,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 1242 transitions. [2019-12-18 13:34:18,219 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 1242 transitions. Word has length 59 [2019-12-18 13:34:18,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:34:18,219 INFO L462 AbstractCegarLoop]: Abstraction has 572 states and 1242 transitions. [2019-12-18 13:34:18,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:34:18,219 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 1242 transitions. [2019-12-18 13:34:18,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:34:18,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:34:18,221 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 13:34:18,221 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 13:34:18,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:34:18,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1384719400, now seen corresponding path program 1 times [2019-12-18 13:34:18,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:34:18,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112679919] [2019-12-18 13:34:18,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:34:18,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:34:18,515 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 13:34:18,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112679919] [2019-12-18 13:34:18,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:34:18,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 13:34:18,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975402962] [2019-12-18 13:34:18,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 13:34:18,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:34:18,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 13:34:18,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-18 13:34:18,517 INFO L87 Difference]: Start difference. First operand 572 states and 1242 transitions. Second operand 14 states. [2019-12-18 13:34:19,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:34:19,295 INFO L93 Difference]: Finished difference Result 916 states and 1999 transitions. [2019-12-18 13:34:19,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 13:34:19,295 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-18 13:34:19,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:34:19,297 INFO L225 Difference]: With dead ends: 916 [2019-12-18 13:34:19,297 INFO L226 Difference]: Without dead ends: 880 [2019-12-18 13:34:19,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2019-12-18 13:34:19,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2019-12-18 13:34:19,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 752. [2019-12-18 13:34:19,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2019-12-18 13:34:19,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1641 transitions. [2019-12-18 13:34:19,307 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1641 transitions. Word has length 60 [2019-12-18 13:34:19,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:34:19,308 INFO L462 AbstractCegarLoop]: Abstraction has 752 states and 1641 transitions. [2019-12-18 13:34:19,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 13:34:19,308 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1641 transitions. [2019-12-18 13:34:19,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:34:19,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:34:19,309 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 13:34:19,309 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 13:34:19,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:34:19,309 INFO L82 PathProgramCache]: Analyzing trace with hash -713679046, now seen corresponding path program 2 times [2019-12-18 13:34:19,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:34:19,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705703099] [2019-12-18 13:34:19,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:34:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:34:19,534 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 13:34:19,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705703099] [2019-12-18 13:34:19,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:34:19,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 13:34:19,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819130870] [2019-12-18 13:34:19,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 13:34:19,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:34:19,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 13:34:19,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:34:19,542 INFO L87 Difference]: Start difference. First operand 752 states and 1641 transitions. Second operand 13 states. [2019-12-18 13:34:20,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:34:20,193 INFO L93 Difference]: Finished difference Result 914 states and 1950 transitions. [2019-12-18 13:34:20,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 13:34:20,194 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-18 13:34:20,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:34:20,195 INFO L225 Difference]: With dead ends: 914 [2019-12-18 13:34:20,196 INFO L226 Difference]: Without dead ends: 878 [2019-12-18 13:34:20,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702 [2019-12-18 13:34:20,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2019-12-18 13:34:20,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 776. [2019-12-18 13:34:20,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-12-18 13:34:20,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1695 transitions. [2019-12-18 13:34:20,204 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1695 transitions. Word has length 60 [2019-12-18 13:34:20,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:34:20,205 INFO L462 AbstractCegarLoop]: Abstraction has 776 states and 1695 transitions. [2019-12-18 13:34:20,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 13:34:20,205 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1695 transitions. [2019-12-18 13:34:20,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:34:20,206 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:34:20,206 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 13:34:20,206 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 13:34:20,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:34:20,206 INFO L82 PathProgramCache]: Analyzing trace with hash 483952232, now seen corresponding path program 3 times [2019-12-18 13:34:20,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:34:20,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146513682] [2019-12-18 13:34:20,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:34:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:34:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:34:20,319 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:34:20,319 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:34:20,323 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 13:34:20,324 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 13:34:20,325 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 13:34:20,326 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 13:34:20,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L4-->L812: Formula: (and (= ~b~0_In-1708006363 ~__unbuffered_p3_EBX~0_Out-1708006363) (= ~z$r_buff0_thd0~0_In-1708006363 ~z$r_buff1_thd0~0_Out-1708006363) (= 1 ~z$r_buff0_thd4~0_Out-1708006363) (not (= P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-1708006363 0)) (= ~z$r_buff1_thd4~0_Out-1708006363 ~z$r_buff0_thd4~0_In-1708006363) (= ~__unbuffered_p3_EAX~0_Out-1708006363 ~a~0_Out-1708006363) (= ~z$r_buff1_thd2~0_Out-1708006363 ~z$r_buff0_thd2~0_In-1708006363) (= ~z$r_buff1_thd3~0_Out-1708006363 ~z$r_buff0_thd3~0_In-1708006363) (= 1 ~a~0_Out-1708006363) (= ~z$r_buff0_thd1~0_In-1708006363 ~z$r_buff1_thd1~0_Out-1708006363)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-1708006363, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1708006363, ~b~0=~b~0_In-1708006363, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1708006363, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1708006363, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1708006363, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1708006363} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-1708006363, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-1708006363, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-1708006363, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-1708006363, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out-1708006363, ~a~0=~a~0_Out-1708006363, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1708006363, ~b~0=~b~0_In-1708006363, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1708006363, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-1708006363, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out-1708006363, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1708006363, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1708006363, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1708006363, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1708006363} 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 13:34:20,328 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 13:34:20,329 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 13:34:20,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-938154717 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-938154717 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-938154717 |P3Thread1of1ForFork3_#t~ite11_Out-938154717|)) (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork3_#t~ite11_Out-938154717|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-938154717, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-938154717} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-938154717, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-938154717, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out-938154717|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-18 13:34:20,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L776-2-->L776-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-993464605 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-993464605 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite3_Out-993464605| ~z~0_In-993464605)) (and (= |P2Thread1of1ForFork2_#t~ite3_Out-993464605| ~z$w_buff1~0_In-993464605) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-993464605, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-993464605, ~z$w_buff1~0=~z$w_buff1~0_In-993464605, ~z~0=~z~0_In-993464605} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out-993464605|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-993464605, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-993464605, ~z$w_buff1~0=~z$w_buff1~0_In-993464605, ~z~0=~z~0_In-993464605} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 13:34:20,332 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 13:34:20,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1077716170 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1077716170 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite5_Out-1077716170|)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1077716170 |P2Thread1of1ForFork2_#t~ite5_Out-1077716170|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1077716170, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1077716170} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-1077716170|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1077716170, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1077716170} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 13:34:20,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In-1196392913 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1196392913 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1196392913 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-1196392913 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite6_Out-1196392913| ~z$w_buff1_used~0_In-1196392913)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork2_#t~ite6_Out-1196392913|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1196392913, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1196392913, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1196392913, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1196392913} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-1196392913|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1196392913, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1196392913, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1196392913, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1196392913} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 13:34:20,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1352000292 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1352000292 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite7_Out1352000292| ~z$r_buff0_thd3~0_In1352000292)) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite7_Out1352000292| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1352000292, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1352000292} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1352000292, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1352000292, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out1352000292|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 13:34:20,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L780-->L780-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-587120796 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-587120796 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-587120796 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-587120796 256)))) (or (and (= ~z$r_buff1_thd3~0_In-587120796 |P2Thread1of1ForFork2_#t~ite8_Out-587120796|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork2_#t~ite8_Out-587120796|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-587120796, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-587120796, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-587120796, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-587120796} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-587120796, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-587120796, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-587120796, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-587120796, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out-587120796|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 13:34:20,336 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 13:34:20,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L814-->L814-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In-499316208 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-499316208 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-499316208 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-499316208 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork3_#t~ite12_Out-499316208| ~z$w_buff1_used~0_In-499316208)) (and (= |P3Thread1of1ForFork3_#t~ite12_Out-499316208| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-499316208, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-499316208, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-499316208, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-499316208} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-499316208, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-499316208, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-499316208, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-499316208, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-499316208|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-18 13:34:20,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L815-->L816: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1410281990 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In1410281990 256) 0))) (or (and (= ~z$r_buff0_thd4~0_Out1410281990 ~z$r_buff0_thd4~0_In1410281990) (or .cse0 .cse1)) (and (not .cse1) (= ~z$r_buff0_thd4~0_Out1410281990 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1410281990, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1410281990} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1410281990, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1410281990, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out1410281990|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-18 13:34:20,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L816-->L816-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In1143427143 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1143427143 256))) (.cse3 (= (mod ~z$r_buff1_thd4~0_In1143427143 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1143427143 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork3_#t~ite14_Out1143427143| ~z$r_buff1_thd4~0_In1143427143) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork3_#t~ite14_Out1143427143|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1143427143, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1143427143, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1143427143, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1143427143} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1143427143, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1143427143, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out1143427143|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1143427143, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1143427143} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-18 13:34:20,338 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 13:34:20,339 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 13:34:20,339 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L847-2-->L847-5: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-275312836 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-275312836 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite20_Out-275312836| |ULTIMATE.start_main_#t~ite19_Out-275312836|))) (or (and (= ~z~0_In-275312836 |ULTIMATE.start_main_#t~ite19_Out-275312836|) .cse0 (or .cse1 .cse2)) (and (not .cse1) (= ~z$w_buff1~0_In-275312836 |ULTIMATE.start_main_#t~ite19_Out-275312836|) (not .cse2) .cse0))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-275312836, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-275312836, ~z$w_buff1~0=~z$w_buff1~0_In-275312836, ~z~0=~z~0_In-275312836} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-275312836|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-275312836, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-275312836, ~z$w_buff1~0=~z$w_buff1~0_In-275312836, ~z~0=~z~0_In-275312836, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-275312836|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 13:34:20,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L848-->L848-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1222762912 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1222762912 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1222762912 |ULTIMATE.start_main_#t~ite21_Out-1222762912|)) (and (= 0 |ULTIMATE.start_main_#t~ite21_Out-1222762912|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1222762912, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1222762912} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1222762912, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1222762912, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1222762912|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 13:34:20,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L849-->L849-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In264204196 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In264204196 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In264204196 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In264204196 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite22_Out264204196| ~z$w_buff1_used~0_In264204196)) (and (= |ULTIMATE.start_main_#t~ite22_Out264204196| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In264204196, ~z$w_buff0_used~0=~z$w_buff0_used~0_In264204196, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In264204196, ~z$w_buff1_used~0=~z$w_buff1_used~0_In264204196} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In264204196, ~z$w_buff0_used~0=~z$w_buff0_used~0_In264204196, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In264204196, ~z$w_buff1_used~0=~z$w_buff1_used~0_In264204196, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out264204196|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 13:34:20,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L850-->L850-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2049530830 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-2049530830 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In-2049530830 |ULTIMATE.start_main_#t~ite23_Out-2049530830|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite23_Out-2049530830|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2049530830, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2049530830} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2049530830, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2049530830, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-2049530830|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 13:34:20,343 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L851-->L851-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd0~0_In-1079624027 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1079624027 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1079624027 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1079624027 256)))) (or (and (= ~z$r_buff1_thd0~0_In-1079624027 |ULTIMATE.start_main_#t~ite24_Out-1079624027|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite24_Out-1079624027|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1079624027, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1079624027, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1079624027, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1079624027} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1079624027, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1079624027, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1079624027, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1079624027|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1079624027} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 13:34:20,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L861-->L861-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1464256324 256) 0))) (or (and (= ~z$w_buff0_used~0_In-1464256324 |ULTIMATE.start_main_#t~ite37_Out-1464256324|) (not .cse0) (= |ULTIMATE.start_main_#t~ite36_In-1464256324| |ULTIMATE.start_main_#t~ite36_Out-1464256324|)) (and (= ~z$w_buff0_used~0_In-1464256324 |ULTIMATE.start_main_#t~ite36_Out-1464256324|) (= |ULTIMATE.start_main_#t~ite37_Out-1464256324| |ULTIMATE.start_main_#t~ite36_Out-1464256324|) (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1464256324 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In-1464256324 256)) (and (= (mod ~z$w_buff1_used~0_In-1464256324 256) 0) .cse1) (and (= 0 (mod ~z$r_buff1_thd0~0_In-1464256324 256)) .cse1))) .cse0))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1464256324, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1464256324, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1464256324, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1464256324, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_In-1464256324|, ~weak$$choice2~0=~weak$$choice2~0_In-1464256324} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1464256324, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1464256324, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1464256324, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1464256324, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1464256324|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1464256324|, ~weak$$choice2~0=~weak$$choice2~0_In-1464256324} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 13:34:20,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L862-->L862-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1450981 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-1450981| |ULTIMATE.start_main_#t~ite39_Out-1450981|) (= ~z$w_buff1_used~0_In-1450981 |ULTIMATE.start_main_#t~ite39_Out-1450981|) (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1450981 256) 0))) (or (and (= 0 (mod ~z$w_buff1_used~0_In-1450981 256)) .cse0) (= (mod ~z$w_buff0_used~0_In-1450981 256) 0) (and (= 0 (mod ~z$r_buff1_thd0~0_In-1450981 256)) .cse0))) .cse1) (and (not .cse1) (= ~z$w_buff1_used~0_In-1450981 |ULTIMATE.start_main_#t~ite40_Out-1450981|) (= |ULTIMATE.start_main_#t~ite39_In-1450981| |ULTIMATE.start_main_#t~ite39_Out-1450981|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1450981, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1450981, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In-1450981|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1450981, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1450981, ~weak$$choice2~0=~weak$$choice2~0_In-1450981} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1450981, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1450981|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1450981|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1450981, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1450981, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1450981, ~weak$$choice2~0=~weak$$choice2~0_In-1450981} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 13:34:20,351 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 13:34:20,353 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 13:34:20,353 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 13:34:20,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:34:20 BasicIcfg [2019-12-18 13:34:20,470 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:34:20,472 INFO L168 Benchmark]: Toolchain (without parser) took 58880.04 ms. Allocated memory was 145.8 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 102.0 MB in the beginning and 1.1 GB in the end (delta: -950.9 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-18 13:34:20,473 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 145.8 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 13:34:20,474 INFO L168 Benchmark]: CACSL2BoogieTranslator took 799.76 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.5 MB in the beginning and 156.2 MB in the end (delta: -54.7 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. [2019-12-18 13:34:20,474 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.75 ms. Allocated memory is still 202.9 MB. Free memory was 156.2 MB in the beginning and 153.0 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-18 13:34:20,475 INFO L168 Benchmark]: Boogie Preprocessor took 37.83 ms. Allocated memory is still 202.9 MB. Free memory was 153.0 MB in the beginning and 150.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:34:20,475 INFO L168 Benchmark]: RCFGBuilder took 817.94 ms. Allocated memory is still 202.9 MB. Free memory was 150.4 MB in the beginning and 100.7 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. [2019-12-18 13:34:20,476 INFO L168 Benchmark]: TraceAbstraction took 57155.52 ms. Allocated memory was 202.9 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 100.7 MB in the beginning and 1.1 GB in the end (delta: -952.2 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-18 13:34:20,480 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.51 ms. Allocated memory is still 145.8 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 799.76 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.5 MB in the beginning and 156.2 MB in the end (delta: -54.7 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.75 ms. Allocated memory is still 202.9 MB. Free memory was 156.2 MB in the beginning and 153.0 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.83 ms. Allocated memory is still 202.9 MB. Free memory was 153.0 MB in the beginning and 150.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 817.94 ms. Allocated memory is still 202.9 MB. Free memory was 150.4 MB in the beginning and 100.7 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 57155.52 ms. Allocated memory was 202.9 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 100.7 MB in the beginning and 1.1 GB in the end (delta: -952.2 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 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.6s, 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: 56.8s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 14.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2337 SDtfs, 3418 SDslu, 5528 SDs, 0 SdLazy, 2674 SolverSat, 273 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 168 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65578occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 29.8s AutomataMinimizationTime, 18 MinimizatonAttempts, 86619 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 741 NumberOfCodeBlocks, 741 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 663 ConstructedInterpolants, 0 QuantifiedInterpolants, 148634 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...