/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/safe017_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:46:30,272 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:46:30,275 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:46:30,296 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:46:30,296 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:46:30,298 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:46:30,300 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:46:30,310 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:46:30,314 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:46:30,317 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:46:30,319 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:46:30,321 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:46:30,321 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:46:30,323 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:46:30,325 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:46:30,327 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:46:30,328 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:46:30,329 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:46:30,331 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:46:30,335 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:46:30,340 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:46:30,344 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:46:30,345 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:46:30,346 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:46:30,348 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:46:30,348 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:46:30,348 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:46:30,350 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:46:30,352 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:46:30,353 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:46:30,353 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:46:30,354 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:46:30,355 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:46:30,356 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:46:30,357 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:46:30,358 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:46:30,358 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:46:30,358 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:46:30,359 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:46:30,359 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:46:30,361 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:46:30,362 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 14:46:30,382 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:46:30,382 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:46:30,384 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:46:30,384 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:46:30,384 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:46:30,384 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:46:30,385 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:46:30,385 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:46:30,385 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:46:30,385 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:46:30,385 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:46:30,385 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:46:30,386 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:46:30,386 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:46:30,386 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:46:30,386 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:46:30,386 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:46:30,387 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:46:30,387 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:46:30,387 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:46:30,387 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:46:30,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:46:30,388 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:46:30,388 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:46:30,388 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:46:30,388 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:46:30,389 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:46:30,389 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:46:30,389 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:46:30,389 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:46:30,674 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:46:30,688 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:46:30,691 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:46:30,693 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:46:30,693 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:46:30,694 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_pso.opt.i [2019-12-18 14:46:30,773 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54e63025d/469e86f6427c476da04cd1833dd07c84/FLAG47b440987 [2019-12-18 14:46:31,351 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:46:31,353 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_pso.opt.i [2019-12-18 14:46:31,373 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54e63025d/469e86f6427c476da04cd1833dd07c84/FLAG47b440987 [2019-12-18 14:46:31,608 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54e63025d/469e86f6427c476da04cd1833dd07c84 [2019-12-18 14:46:31,617 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:46:31,619 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:46:31,620 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:46:31,621 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:46:31,624 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:46:31,625 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:46:31" (1/1) ... [2019-12-18 14:46:31,628 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40a6ebe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:46:31, skipping insertion in model container [2019-12-18 14:46:31,628 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:46:31" (1/1) ... [2019-12-18 14:46:31,636 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:46:31,694 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:46:32,267 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:46:32,282 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:46:32,344 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:46:32,416 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:46:32,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:46:32 WrapperNode [2019-12-18 14:46:32,417 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:46:32,418 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:46:32,418 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:46:32,418 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:46:32,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:46:32" (1/1) ... [2019-12-18 14:46:32,448 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:46:32" (1/1) ... [2019-12-18 14:46:32,486 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:46:32,486 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:46:32,486 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:46:32,486 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:46:32,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:46:32" (1/1) ... [2019-12-18 14:46:32,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:46:32" (1/1) ... [2019-12-18 14:46:32,502 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:46:32" (1/1) ... [2019-12-18 14:46:32,502 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:46:32" (1/1) ... [2019-12-18 14:46:32,513 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:46:32" (1/1) ... [2019-12-18 14:46:32,518 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:46:32" (1/1) ... [2019-12-18 14:46:32,522 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:46:32" (1/1) ... [2019-12-18 14:46:32,527 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:46:32,528 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:46:32,528 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:46:32,528 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:46:32,529 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:46:32" (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 14:46:32,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:46:32,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:46:32,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:46:32,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:46:32,603 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:46:32,604 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:46:32,604 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:46:32,604 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:46:32,604 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 14:46:32,605 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 14:46:32,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:46:32,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:46:32,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:46:32,607 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 14:46:33,385 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:46:33,385 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:46:33,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:46:33 BoogieIcfgContainer [2019-12-18 14:46:33,387 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:46:33,388 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:46:33,388 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:46:33,392 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:46:33,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:46:31" (1/3) ... [2019-12-18 14:46:33,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c6c0418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:46:33, skipping insertion in model container [2019-12-18 14:46:33,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:46:32" (2/3) ... [2019-12-18 14:46:33,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c6c0418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:46:33, skipping insertion in model container [2019-12-18 14:46:33,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:46:33" (3/3) ... [2019-12-18 14:46:33,396 INFO L109 eAbstractionObserver]: Analyzing ICFG safe017_pso.opt.i [2019-12-18 14:46:33,407 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:46:33,407 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:46:33,416 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:46:33,417 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:46:33,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,459 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,460 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,460 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,460 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,461 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,471 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,472 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,484 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,485 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,519 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,523 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,523 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,524 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,535 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,535 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,539 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,539 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:46:33,552 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 14:46:33,568 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:46:33,568 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:46:33,568 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:46:33,568 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:46:33,568 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:46:33,568 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:46:33,568 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:46:33,569 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:46:33,586 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 210 transitions [2019-12-18 14:46:33,588 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-18 14:46:33,676 INFO L126 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-18 14:46:33,676 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:46:33,700 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 9/167 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 14:46:33,727 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-18 14:46:33,772 INFO L126 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-18 14:46:33,772 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:46:33,780 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 9/167 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 14:46:33,799 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-18 14:46:33,801 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:46:38,943 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 14:46:39,089 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 14:46:39,114 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78185 [2019-12-18 14:46:39,114 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-18 14:46:39,118 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 104 transitions [2019-12-18 14:46:55,185 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 112926 states. [2019-12-18 14:46:55,187 INFO L276 IsEmpty]: Start isEmpty. Operand 112926 states. [2019-12-18 14:46:55,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 14:46:55,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:46:55,192 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 14:46:55,193 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:46:55,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:46:55,197 INFO L82 PathProgramCache]: Analyzing trace with hash 844394, now seen corresponding path program 1 times [2019-12-18 14:46:55,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:46:55,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970304332] [2019-12-18 14:46:55,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:46:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:46:55,397 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 14:46:55,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970304332] [2019-12-18 14:46:55,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:46:55,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:46:55,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360303576] [2019-12-18 14:46:55,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:46:55,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:46:55,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:46:55,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:46:55,421 INFO L87 Difference]: Start difference. First operand 112926 states. Second operand 3 states. [2019-12-18 14:46:56,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:46:56,673 INFO L93 Difference]: Finished difference Result 112536 states and 479624 transitions. [2019-12-18 14:46:56,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:46:56,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 14:46:56,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:46:57,555 INFO L225 Difference]: With dead ends: 112536 [2019-12-18 14:46:57,555 INFO L226 Difference]: Without dead ends: 110184 [2019-12-18 14:46:57,558 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 14:47:04,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110184 states. [2019-12-18 14:47:07,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110184 to 110184. [2019-12-18 14:47:07,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110184 states. [2019-12-18 14:47:07,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110184 states to 110184 states and 470020 transitions. [2019-12-18 14:47:07,836 INFO L78 Accepts]: Start accepts. Automaton has 110184 states and 470020 transitions. Word has length 3 [2019-12-18 14:47:07,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:47:07,836 INFO L462 AbstractCegarLoop]: Abstraction has 110184 states and 470020 transitions. [2019-12-18 14:47:07,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:47:07,836 INFO L276 IsEmpty]: Start isEmpty. Operand 110184 states and 470020 transitions. [2019-12-18 14:47:07,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:47:07,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:47:07,841 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:47:07,841 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:47:07,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:47:07,842 INFO L82 PathProgramCache]: Analyzing trace with hash -418531443, now seen corresponding path program 1 times [2019-12-18 14:47:07,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:47:07,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232304023] [2019-12-18 14:47:07,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:47:07,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:47:07,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 14:47:07,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232304023] [2019-12-18 14:47:07,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:47:07,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:47:07,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733477107] [2019-12-18 14:47:07,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:47:07,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:47:07,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:47:07,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:47:07,993 INFO L87 Difference]: Start difference. First operand 110184 states and 470020 transitions. Second operand 4 states. [2019-12-18 14:47:13,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:47:13,574 INFO L93 Difference]: Finished difference Result 172298 states and 706272 transitions. [2019-12-18 14:47:13,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:47:13,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:47:13,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:47:14,160 INFO L225 Difference]: With dead ends: 172298 [2019-12-18 14:47:14,160 INFO L226 Difference]: Without dead ends: 172249 [2019-12-18 14:47:14,161 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 14:47:22,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172249 states. [2019-12-18 14:47:25,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172249 to 156321. [2019-12-18 14:47:25,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156321 states. [2019-12-18 14:47:26,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156321 states to 156321 states and 647667 transitions. [2019-12-18 14:47:26,815 INFO L78 Accepts]: Start accepts. Automaton has 156321 states and 647667 transitions. Word has length 11 [2019-12-18 14:47:26,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:47:26,816 INFO L462 AbstractCegarLoop]: Abstraction has 156321 states and 647667 transitions. [2019-12-18 14:47:26,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:47:26,816 INFO L276 IsEmpty]: Start isEmpty. Operand 156321 states and 647667 transitions. [2019-12-18 14:47:26,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:47:26,823 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:47:26,823 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:47:26,823 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:47:26,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:47:26,824 INFO L82 PathProgramCache]: Analyzing trace with hash -986312255, now seen corresponding path program 1 times [2019-12-18 14:47:26,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:47:26,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35654753] [2019-12-18 14:47:26,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:47:26,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:47:26,910 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 14:47:26,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35654753] [2019-12-18 14:47:26,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:47:26,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:47:26,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293553010] [2019-12-18 14:47:26,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:47:26,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:47:26,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:47:26,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:47:26,912 INFO L87 Difference]: Start difference. First operand 156321 states and 647667 transitions. Second operand 3 states. [2019-12-18 14:47:27,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:47:27,032 INFO L93 Difference]: Finished difference Result 32129 states and 104196 transitions. [2019-12-18 14:47:27,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:47:27,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 14:47:27,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:47:27,081 INFO L225 Difference]: With dead ends: 32129 [2019-12-18 14:47:27,081 INFO L226 Difference]: Without dead ends: 32129 [2019-12-18 14:47:27,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:47:27,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32129 states. [2019-12-18 14:47:27,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32129 to 32129. [2019-12-18 14:47:27,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32129 states. [2019-12-18 14:47:27,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32129 states to 32129 states and 104196 transitions. [2019-12-18 14:47:27,623 INFO L78 Accepts]: Start accepts. Automaton has 32129 states and 104196 transitions. Word has length 13 [2019-12-18 14:47:27,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:47:27,623 INFO L462 AbstractCegarLoop]: Abstraction has 32129 states and 104196 transitions. [2019-12-18 14:47:27,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:47:27,624 INFO L276 IsEmpty]: Start isEmpty. Operand 32129 states and 104196 transitions. [2019-12-18 14:47:27,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:47:27,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:47:27,626 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:47:27,626 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:47:27,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:47:27,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1176456771, now seen corresponding path program 1 times [2019-12-18 14:47:27,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:47:27,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099668428] [2019-12-18 14:47:27,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:47:27,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:47:27,735 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 14:47:27,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099668428] [2019-12-18 14:47:27,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:47:27,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:47:27,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866356064] [2019-12-18 14:47:27,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:47:27,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:47:27,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:47:27,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:47:27,737 INFO L87 Difference]: Start difference. First operand 32129 states and 104196 transitions. Second operand 4 states. [2019-12-18 14:47:28,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:47:28,186 INFO L93 Difference]: Finished difference Result 43159 states and 136814 transitions. [2019-12-18 14:47:28,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:47:28,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 14:47:28,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:47:28,256 INFO L225 Difference]: With dead ends: 43159 [2019-12-18 14:47:28,256 INFO L226 Difference]: Without dead ends: 43152 [2019-12-18 14:47:28,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:47:28,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43152 states. [2019-12-18 14:47:31,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43152 to 37631. [2019-12-18 14:47:31,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37631 states. [2019-12-18 14:47:31,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37631 states to 37631 states and 121166 transitions. [2019-12-18 14:47:31,381 INFO L78 Accepts]: Start accepts. Automaton has 37631 states and 121166 transitions. Word has length 13 [2019-12-18 14:47:31,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:47:31,382 INFO L462 AbstractCegarLoop]: Abstraction has 37631 states and 121166 transitions. [2019-12-18 14:47:31,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:47:31,382 INFO L276 IsEmpty]: Start isEmpty. Operand 37631 states and 121166 transitions. [2019-12-18 14:47:31,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 14:47:31,386 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:47:31,386 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:47:31,386 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:47:31,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:47:31,386 INFO L82 PathProgramCache]: Analyzing trace with hash -2012510844, now seen corresponding path program 1 times [2019-12-18 14:47:31,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:47:31,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997397299] [2019-12-18 14:47:31,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:47:31,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:47:31,531 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 14:47:31,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997397299] [2019-12-18 14:47:31,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:47:31,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:47:31,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594683233] [2019-12-18 14:47:31,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:47:31,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:47:31,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:47:31,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:47:31,538 INFO L87 Difference]: Start difference. First operand 37631 states and 121166 transitions. Second operand 5 states. [2019-12-18 14:47:32,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:47:32,315 INFO L93 Difference]: Finished difference Result 50788 states and 160280 transitions. [2019-12-18 14:47:32,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:47:32,316 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 14:47:32,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:47:32,391 INFO L225 Difference]: With dead ends: 50788 [2019-12-18 14:47:32,391 INFO L226 Difference]: Without dead ends: 50775 [2019-12-18 14:47:32,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 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 14:47:32,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50775 states. [2019-12-18 14:47:33,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50775 to 38059. [2019-12-18 14:47:33,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38059 states. [2019-12-18 14:47:33,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38059 states to 38059 states and 122380 transitions. [2019-12-18 14:47:33,132 INFO L78 Accepts]: Start accepts. Automaton has 38059 states and 122380 transitions. Word has length 19 [2019-12-18 14:47:33,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:47:33,132 INFO L462 AbstractCegarLoop]: Abstraction has 38059 states and 122380 transitions. [2019-12-18 14:47:33,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:47:33,132 INFO L276 IsEmpty]: Start isEmpty. Operand 38059 states and 122380 transitions. [2019-12-18 14:47:33,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 14:47:33,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:47:33,146 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:47:33,146 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:47:33,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:47:33,146 INFO L82 PathProgramCache]: Analyzing trace with hash -394195806, now seen corresponding path program 1 times [2019-12-18 14:47:33,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:47:33,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787290807] [2019-12-18 14:47:33,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:47:33,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:47:33,221 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 14:47:33,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787290807] [2019-12-18 14:47:33,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:47:33,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:47:33,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104811541] [2019-12-18 14:47:33,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:47:33,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:47:33,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:47:33,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:47:33,226 INFO L87 Difference]: Start difference. First operand 38059 states and 122380 transitions. Second operand 4 states. [2019-12-18 14:47:33,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:47:33,271 INFO L93 Difference]: Finished difference Result 7382 states and 20162 transitions. [2019-12-18 14:47:33,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:47:33,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 14:47:33,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:47:33,283 INFO L225 Difference]: With dead ends: 7382 [2019-12-18 14:47:33,283 INFO L226 Difference]: Without dead ends: 7382 [2019-12-18 14:47:33,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:47:33,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2019-12-18 14:47:33,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7270. [2019-12-18 14:47:33,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7270 states. [2019-12-18 14:47:33,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7270 states to 7270 states and 19842 transitions. [2019-12-18 14:47:33,380 INFO L78 Accepts]: Start accepts. Automaton has 7270 states and 19842 transitions. Word has length 25 [2019-12-18 14:47:33,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:47:33,380 INFO L462 AbstractCegarLoop]: Abstraction has 7270 states and 19842 transitions. [2019-12-18 14:47:33,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:47:33,380 INFO L276 IsEmpty]: Start isEmpty. Operand 7270 states and 19842 transitions. [2019-12-18 14:47:33,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 14:47:33,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:47:33,392 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:47:33,392 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:47:33,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:47:33,393 INFO L82 PathProgramCache]: Analyzing trace with hash 56145512, now seen corresponding path program 1 times [2019-12-18 14:47:33,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:47:33,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448220582] [2019-12-18 14:47:33,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:47:33,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:47:33,458 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 14:47:33,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448220582] [2019-12-18 14:47:33,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:47:33,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:47:33,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267628302] [2019-12-18 14:47:33,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:47:33,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:47:33,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:47:33,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:47:33,460 INFO L87 Difference]: Start difference. First operand 7270 states and 19842 transitions. Second operand 5 states. [2019-12-18 14:47:33,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:47:33,502 INFO L93 Difference]: Finished difference Result 5311 states and 15265 transitions. [2019-12-18 14:47:33,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:47:33,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 14:47:33,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:47:33,511 INFO L225 Difference]: With dead ends: 5311 [2019-12-18 14:47:33,511 INFO L226 Difference]: Without dead ends: 5311 [2019-12-18 14:47:33,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:47:33,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5311 states. [2019-12-18 14:47:33,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5311 to 4947. [2019-12-18 14:47:33,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4947 states. [2019-12-18 14:47:33,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4947 states to 4947 states and 14281 transitions. [2019-12-18 14:47:33,593 INFO L78 Accepts]: Start accepts. Automaton has 4947 states and 14281 transitions. Word has length 37 [2019-12-18 14:47:33,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:47:33,594 INFO L462 AbstractCegarLoop]: Abstraction has 4947 states and 14281 transitions. [2019-12-18 14:47:33,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:47:33,594 INFO L276 IsEmpty]: Start isEmpty. Operand 4947 states and 14281 transitions. [2019-12-18 14:47:33,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:47:33,601 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:47:33,601 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:47:33,602 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:47:33,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:47:33,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1380306829, now seen corresponding path program 1 times [2019-12-18 14:47:33,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:47:33,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570024914] [2019-12-18 14:47:33,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:47:33,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:47:33,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:47:33,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570024914] [2019-12-18 14:47:33,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:47:33,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:47:33,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395986078] [2019-12-18 14:47:33,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:47:33,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:47:33,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:47:33,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:47:33,673 INFO L87 Difference]: Start difference. First operand 4947 states and 14281 transitions. Second operand 3 states. [2019-12-18 14:47:33,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:47:33,729 INFO L93 Difference]: Finished difference Result 4958 states and 14296 transitions. [2019-12-18 14:47:33,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:47:33,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 14:47:33,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:47:33,738 INFO L225 Difference]: With dead ends: 4958 [2019-12-18 14:47:33,739 INFO L226 Difference]: Without dead ends: 4958 [2019-12-18 14:47:33,739 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 14:47:33,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4958 states. [2019-12-18 14:47:33,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4958 to 4954. [2019-12-18 14:47:33,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4954 states. [2019-12-18 14:47:34,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4954 states to 4954 states and 14292 transitions. [2019-12-18 14:47:34,152 INFO L78 Accepts]: Start accepts. Automaton has 4954 states and 14292 transitions. Word has length 65 [2019-12-18 14:47:34,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:47:34,156 INFO L462 AbstractCegarLoop]: Abstraction has 4954 states and 14292 transitions. [2019-12-18 14:47:34,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:47:34,156 INFO L276 IsEmpty]: Start isEmpty. Operand 4954 states and 14292 transitions. [2019-12-18 14:47:34,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:47:34,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:47:34,167 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:47:34,167 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:47:34,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:47:34,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1838424094, now seen corresponding path program 1 times [2019-12-18 14:47:34,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:47:34,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793443424] [2019-12-18 14:47:34,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:47:34,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:47:34,337 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 14:47:34,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793443424] [2019-12-18 14:47:34,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:47:34,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:47:34,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112268447] [2019-12-18 14:47:34,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:47:34,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:47:34,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:47:34,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:47:34,344 INFO L87 Difference]: Start difference. First operand 4954 states and 14292 transitions. Second operand 5 states. [2019-12-18 14:47:34,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:47:34,653 INFO L93 Difference]: Finished difference Result 7545 states and 21557 transitions. [2019-12-18 14:47:34,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:47:34,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 14:47:34,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:47:34,664 INFO L225 Difference]: With dead ends: 7545 [2019-12-18 14:47:34,664 INFO L226 Difference]: Without dead ends: 7545 [2019-12-18 14:47:34,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:47:34,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7545 states. [2019-12-18 14:47:34,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7545 to 6351. [2019-12-18 14:47:34,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6351 states. [2019-12-18 14:47:34,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6351 states to 6351 states and 18327 transitions. [2019-12-18 14:47:34,761 INFO L78 Accepts]: Start accepts. Automaton has 6351 states and 18327 transitions. Word has length 65 [2019-12-18 14:47:34,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:47:34,761 INFO L462 AbstractCegarLoop]: Abstraction has 6351 states and 18327 transitions. [2019-12-18 14:47:34,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:47:34,761 INFO L276 IsEmpty]: Start isEmpty. Operand 6351 states and 18327 transitions. [2019-12-18 14:47:34,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:47:34,770 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:47:34,771 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:47:34,771 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:47:34,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:47:34,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1320159464, now seen corresponding path program 2 times [2019-12-18 14:47:34,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:47:34,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621724630] [2019-12-18 14:47:34,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:47:34,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:47:34,870 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 14:47:34,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621724630] [2019-12-18 14:47:34,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:47:34,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:47:34,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957707417] [2019-12-18 14:47:34,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:47:34,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:47:34,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:47:34,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:47:34,872 INFO L87 Difference]: Start difference. First operand 6351 states and 18327 transitions. Second operand 6 states. [2019-12-18 14:47:35,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:47:35,360 INFO L93 Difference]: Finished difference Result 10885 states and 31206 transitions. [2019-12-18 14:47:35,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:47:35,361 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 14:47:35,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:47:35,380 INFO L225 Difference]: With dead ends: 10885 [2019-12-18 14:47:35,381 INFO L226 Difference]: Without dead ends: 10885 [2019-12-18 14:47:35,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:47:35,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10885 states. [2019-12-18 14:47:35,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10885 to 7013. [2019-12-18 14:47:35,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7013 states. [2019-12-18 14:47:35,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7013 states to 7013 states and 20305 transitions. [2019-12-18 14:47:35,583 INFO L78 Accepts]: Start accepts. Automaton has 7013 states and 20305 transitions. Word has length 65 [2019-12-18 14:47:35,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:47:35,583 INFO L462 AbstractCegarLoop]: Abstraction has 7013 states and 20305 transitions. [2019-12-18 14:47:35,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:47:35,583 INFO L276 IsEmpty]: Start isEmpty. Operand 7013 states and 20305 transitions. [2019-12-18 14:47:35,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:47:35,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:47:35,596 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:47:35,596 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:47:35,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:47:35,597 INFO L82 PathProgramCache]: Analyzing trace with hash -518212600, now seen corresponding path program 3 times [2019-12-18 14:47:35,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:47:35,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329423299] [2019-12-18 14:47:35,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:47:35,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:47:35,730 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 14:47:35,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329423299] [2019-12-18 14:47:35,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:47:35,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:47:35,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508039301] [2019-12-18 14:47:35,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:47:35,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:47:35,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:47:35,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:47:35,733 INFO L87 Difference]: Start difference. First operand 7013 states and 20305 transitions. Second operand 7 states. [2019-12-18 14:47:36,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:47:36,532 INFO L93 Difference]: Finished difference Result 10692 states and 30648 transitions. [2019-12-18 14:47:36,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 14:47:36,532 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 14:47:36,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:47:36,546 INFO L225 Difference]: With dead ends: 10692 [2019-12-18 14:47:36,546 INFO L226 Difference]: Without dead ends: 10692 [2019-12-18 14:47:36,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-18 14:47:36,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10692 states. [2019-12-18 14:47:36,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10692 to 6617. [2019-12-18 14:47:36,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6617 states. [2019-12-18 14:47:36,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6617 states to 6617 states and 19142 transitions. [2019-12-18 14:47:36,658 INFO L78 Accepts]: Start accepts. Automaton has 6617 states and 19142 transitions. Word has length 65 [2019-12-18 14:47:36,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:47:36,658 INFO L462 AbstractCegarLoop]: Abstraction has 6617 states and 19142 transitions. [2019-12-18 14:47:36,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:47:36,659 INFO L276 IsEmpty]: Start isEmpty. Operand 6617 states and 19142 transitions. [2019-12-18 14:47:36,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:47:36,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:47:36,668 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:47:36,668 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:47:36,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:47:36,668 INFO L82 PathProgramCache]: Analyzing trace with hash -61468540, now seen corresponding path program 4 times [2019-12-18 14:47:36,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:47:36,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337285547] [2019-12-18 14:47:36,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:47:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:47:36,779 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 14:47:36,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337285547] [2019-12-18 14:47:36,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:47:36,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:47:36,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65104540] [2019-12-18 14:47:36,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:47:36,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:47:36,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:47:36,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:47:36,781 INFO L87 Difference]: Start difference. First operand 6617 states and 19142 transitions. Second operand 6 states. [2019-12-18 14:47:37,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:47:37,349 INFO L93 Difference]: Finished difference Result 9281 states and 26360 transitions. [2019-12-18 14:47:37,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 14:47:37,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 14:47:37,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:47:37,363 INFO L225 Difference]: With dead ends: 9281 [2019-12-18 14:47:37,364 INFO L226 Difference]: Without dead ends: 9281 [2019-12-18 14:47:37,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:47:37,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9281 states. [2019-12-18 14:47:37,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9281 to 6874. [2019-12-18 14:47:37,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6874 states. [2019-12-18 14:47:37,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6874 states to 6874 states and 19886 transitions. [2019-12-18 14:47:37,515 INFO L78 Accepts]: Start accepts. Automaton has 6874 states and 19886 transitions. Word has length 65 [2019-12-18 14:47:37,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:47:37,515 INFO L462 AbstractCegarLoop]: Abstraction has 6874 states and 19886 transitions. [2019-12-18 14:47:37,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:47:37,515 INFO L276 IsEmpty]: Start isEmpty. Operand 6874 states and 19886 transitions. [2019-12-18 14:47:37,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:47:37,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:47:37,528 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:47:37,529 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:47:37,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:47:37,529 INFO L82 PathProgramCache]: Analyzing trace with hash 49095600, now seen corresponding path program 5 times [2019-12-18 14:47:37,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:47:37,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058133028] [2019-12-18 14:47:37,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:47:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:47:37,631 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 14:47:37,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058133028] [2019-12-18 14:47:37,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:47:37,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:47:37,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124163083] [2019-12-18 14:47:37,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:47:37,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:47:37,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:47:37,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:47:37,634 INFO L87 Difference]: Start difference. First operand 6874 states and 19886 transitions. Second operand 6 states. [2019-12-18 14:47:38,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:47:38,168 INFO L93 Difference]: Finished difference Result 11084 states and 31825 transitions. [2019-12-18 14:47:38,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:47:38,169 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 14:47:38,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:47:38,187 INFO L225 Difference]: With dead ends: 11084 [2019-12-18 14:47:38,187 INFO L226 Difference]: Without dead ends: 11084 [2019-12-18 14:47:38,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:47:38,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11084 states. [2019-12-18 14:47:38,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11084 to 7342. [2019-12-18 14:47:38,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7342 states. [2019-12-18 14:47:38,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7342 states to 7342 states and 21312 transitions. [2019-12-18 14:47:38,325 INFO L78 Accepts]: Start accepts. Automaton has 7342 states and 21312 transitions. Word has length 65 [2019-12-18 14:47:38,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:47:38,325 INFO L462 AbstractCegarLoop]: Abstraction has 7342 states and 21312 transitions. [2019-12-18 14:47:38,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:47:38,325 INFO L276 IsEmpty]: Start isEmpty. Operand 7342 states and 21312 transitions. [2019-12-18 14:47:38,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:47:38,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:47:38,335 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:47:38,336 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:47:38,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:47:38,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1715239754, now seen corresponding path program 6 times [2019-12-18 14:47:38,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:47:38,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477724340] [2019-12-18 14:47:38,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:47:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:47:38,413 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 14:47:38,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477724340] [2019-12-18 14:47:38,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:47:38,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:47:38,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546606779] [2019-12-18 14:47:38,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:47:38,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:47:38,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:47:38,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:47:38,415 INFO L87 Difference]: Start difference. First operand 7342 states and 21312 transitions. Second operand 3 states. [2019-12-18 14:47:38,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:47:38,473 INFO L93 Difference]: Finished difference Result 7342 states and 21311 transitions. [2019-12-18 14:47:38,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:47:38,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 14:47:38,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:47:38,484 INFO L225 Difference]: With dead ends: 7342 [2019-12-18 14:47:38,485 INFO L226 Difference]: Without dead ends: 7342 [2019-12-18 14:47:38,486 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 14:47:38,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7342 states. [2019-12-18 14:47:38,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7342 to 4789. [2019-12-18 14:47:38,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4789 states. [2019-12-18 14:47:38,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4789 states to 4789 states and 14184 transitions. [2019-12-18 14:47:38,569 INFO L78 Accepts]: Start accepts. Automaton has 4789 states and 14184 transitions. Word has length 65 [2019-12-18 14:47:38,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:47:38,569 INFO L462 AbstractCegarLoop]: Abstraction has 4789 states and 14184 transitions. [2019-12-18 14:47:38,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:47:38,569 INFO L276 IsEmpty]: Start isEmpty. Operand 4789 states and 14184 transitions. [2019-12-18 14:47:38,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:47:38,577 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:47:38,577 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:47:38,577 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:47:38,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:47:38,577 INFO L82 PathProgramCache]: Analyzing trace with hash -655270585, now seen corresponding path program 1 times [2019-12-18 14:47:38,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:47:38,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827140526] [2019-12-18 14:47:38,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:47:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:47:38,628 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 14:47:38,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827140526] [2019-12-18 14:47:38,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:47:38,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:47:38,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850483363] [2019-12-18 14:47:38,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:47:38,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:47:38,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:47:38,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:47:38,630 INFO L87 Difference]: Start difference. First operand 4789 states and 14184 transitions. Second operand 3 states. [2019-12-18 14:47:38,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:47:38,654 INFO L93 Difference]: Finished difference Result 4399 states and 12698 transitions. [2019-12-18 14:47:38,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:47:38,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 14:47:38,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:47:38,662 INFO L225 Difference]: With dead ends: 4399 [2019-12-18 14:47:38,662 INFO L226 Difference]: Without dead ends: 4399 [2019-12-18 14:47:38,664 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 14:47:38,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4399 states. [2019-12-18 14:47:38,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4399 to 3985. [2019-12-18 14:47:38,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3985 states. [2019-12-18 14:47:38,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3985 states to 3985 states and 11522 transitions. [2019-12-18 14:47:38,744 INFO L78 Accepts]: Start accepts. Automaton has 3985 states and 11522 transitions. Word has length 66 [2019-12-18 14:47:38,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:47:38,745 INFO L462 AbstractCegarLoop]: Abstraction has 3985 states and 11522 transitions. [2019-12-18 14:47:38,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:47:38,745 INFO L276 IsEmpty]: Start isEmpty. Operand 3985 states and 11522 transitions. [2019-12-18 14:47:38,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:47:38,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:47:38,753 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:47:38,754 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:47:38,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:47:38,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1492386830, now seen corresponding path program 1 times [2019-12-18 14:47:38,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:47:38,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869918370] [2019-12-18 14:47:38,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:47:38,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:47:38,844 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 14:47:38,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869918370] [2019-12-18 14:47:38,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:47:38,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:47:38,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730338932] [2019-12-18 14:47:38,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:47:38,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:47:38,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:47:38,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:47:38,848 INFO L87 Difference]: Start difference. First operand 3985 states and 11522 transitions. Second operand 3 states. [2019-12-18 14:47:38,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:47:38,871 INFO L93 Difference]: Finished difference Result 3691 states and 10431 transitions. [2019-12-18 14:47:38,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:47:38,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 14:47:38,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:47:38,878 INFO L225 Difference]: With dead ends: 3691 [2019-12-18 14:47:38,878 INFO L226 Difference]: Without dead ends: 3691 [2019-12-18 14:47:38,878 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 14:47:38,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3691 states. [2019-12-18 14:47:38,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3691 to 2989. [2019-12-18 14:47:38,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2989 states. [2019-12-18 14:47:38,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2989 states and 8461 transitions. [2019-12-18 14:47:38,945 INFO L78 Accepts]: Start accepts. Automaton has 2989 states and 8461 transitions. Word has length 67 [2019-12-18 14:47:38,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:47:38,945 INFO L462 AbstractCegarLoop]: Abstraction has 2989 states and 8461 transitions. [2019-12-18 14:47:38,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:47:38,945 INFO L276 IsEmpty]: Start isEmpty. Operand 2989 states and 8461 transitions. [2019-12-18 14:47:38,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:47:38,950 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:47:38,950 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:47:38,950 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:47:38,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:47:38,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1149441136, now seen corresponding path program 1 times [2019-12-18 14:47:38,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:47:38,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767128805] [2019-12-18 14:47:38,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:47:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:47:39,356 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 14:47:39,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767128805] [2019-12-18 14:47:39,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:47:39,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 14:47:39,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831539257] [2019-12-18 14:47:39,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 14:47:39,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:47:39,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 14:47:39,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:47:39,358 INFO L87 Difference]: Start difference. First operand 2989 states and 8461 transitions. Second operand 12 states. [2019-12-18 14:47:39,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:47:39,769 INFO L93 Difference]: Finished difference Result 5702 states and 16070 transitions. [2019-12-18 14:47:39,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 14:47:39,770 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 68 [2019-12-18 14:47:39,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:47:39,778 INFO L225 Difference]: With dead ends: 5702 [2019-12-18 14:47:39,778 INFO L226 Difference]: Without dead ends: 5670 [2019-12-18 14:47:39,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-18 14:47:39,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5670 states. [2019-12-18 14:47:39,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5670 to 4144. [2019-12-18 14:47:39,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4144 states. [2019-12-18 14:47:39,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 11624 transitions. [2019-12-18 14:47:39,848 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 11624 transitions. Word has length 68 [2019-12-18 14:47:39,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:47:39,849 INFO L462 AbstractCegarLoop]: Abstraction has 4144 states and 11624 transitions. [2019-12-18 14:47:39,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 14:47:39,849 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 11624 transitions. [2019-12-18 14:47:39,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:47:39,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:47:39,853 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:47:39,854 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:47:39,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:47:39,854 INFO L82 PathProgramCache]: Analyzing trace with hash 15770806, now seen corresponding path program 2 times [2019-12-18 14:47:39,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:47:39,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975091208] [2019-12-18 14:47:39,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:47:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:47:39,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:47:39,975 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:47:39,976 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:47:39,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~y$mem_tmp~0_39 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 v_~y$r_buff0_thd3~0_110) (= v_~main$tmp_guard0~0_18 0) (= v_~weak$$choice2~0_126 0) (= 0 v_~x~0_147) (= v_~y$r_buff0_thd0~0_348 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff1~0_200 0) (= 0 v_~y$w_buff0~0_179) (= v_~y~0_170 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$r_buff1_thd0~0_299 0) (= 0 |v_ULTIMATE.start_main_~#t2186~0.offset_20|) (= 0 v_~y$r_buff1_thd2~0_193) (= v_~y$r_buff0_thd1~0_223 0) (= 0 v_~__unbuffered_p2_EAX~0_33) (= |v_#valid_63| (store .cse0 |v_ULTIMATE.start_main_~#t2186~0.base_27| 1)) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$flush_delayed~0_56) (= (select .cse0 |v_ULTIMATE.start_main_~#t2186~0.base_27|) 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t2186~0.base_27| 4) |v_#length_25|) (= |v_#NULL.offset_5| 0) (= v_~y$w_buff1_used~0_482 0) (= 0 v_~y$r_buff1_thd3~0_211) (= 0 v_~y$r_buff0_thd2~0_114) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2186~0.base_27| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2186~0.base_27|) |v_ULTIMATE.start_main_~#t2186~0.offset_20| 0))) (= v_~__unbuffered_cnt~0_132 0) (= v_~y$w_buff0_used~0_741 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2186~0.base_27|) (= 0 v_~weak$$choice0~0_34) (= 0 |v_#NULL.base_5|) (= v_~y$r_buff1_thd1~0_185 0) (= v_~main$tmp_guard1~0_22 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_61|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_27|, ULTIMATE.start_main_~#t2188~0.base=|v_ULTIMATE.start_main_~#t2188~0.base_19|, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_27|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_45|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_141|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_41|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_76|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_62|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_36|, ~y$mem_tmp~0=v_~y$mem_tmp~0_39, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_211, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_223, ~y$flush_delayed~0=v_~y$flush_delayed~0_56, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ULTIMATE.start_main_~#t2188~0.offset=|v_ULTIMATE.start_main_~#t2188~0.offset_16|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_82|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_54|, ULTIMATE.start_main_~#t2186~0.base=|v_ULTIMATE.start_main_~#t2186~0.base_27|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_64|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_31|, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~y$w_buff1~0=v_~y$w_buff1~0_200, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_114, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_132, ULTIMATE.start_main_~#t2187~0.base=|v_ULTIMATE.start_main_~#t2187~0.base_23|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_299, ~x~0=v_~x~0_147, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_61|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_741, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_73|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_31|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_27|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_161|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_30|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_76|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_185, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ~y$w_buff0~0=v_~y$w_buff0~0_179, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_110, ~y~0=v_~y~0_170, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_21|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_43|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_70|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_~#t2187~0.offset=|v_ULTIMATE.start_main_~#t2187~0.offset_18|, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_25|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_50|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_193, ULTIMATE.start_main_~#t2186~0.offset=|v_ULTIMATE.start_main_~#t2186~0.offset_20|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_75|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_348, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_482} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t2188~0.base, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2188~0.offset, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t2186~0.base, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2187~0.base, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_#t~nondet31, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite51, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2187~0.offset, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t2186~0.offset, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 14:47:39,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P0ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_135 1) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_8|) (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_8|) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= 2 v_~y$w_buff0~0_28) (= (mod v_~y$w_buff1_used~0_63 256) 0) (= v_~y$w_buff0~0_29 v_~y$w_buff1~0_20) (= v_~y$w_buff1_used~0_63 v_~y$w_buff0_used~0_136) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_10 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff0~0=v_~y$w_buff0~0_29, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_28, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_10, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_63} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 14:47:39,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L800-1-->L802: Formula: (and (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t2187~0.base_11| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2187~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2187~0.base_11|) |v_ULTIMATE.start_main_~#t2187~0.offset_10| 1)) |v_#memory_int_11|) (= |v_ULTIMATE.start_main_~#t2187~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t2187~0.base_11|)) (= (select |v_#valid_38| |v_ULTIMATE.start_main_~#t2187~0.base_11|) 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2187~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2187~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2187~0.offset=|v_ULTIMATE.start_main_~#t2187~0.offset_10|, ULTIMATE.start_main_~#t2187~0.base=|v_ULTIMATE.start_main_~#t2187~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2187~0.offset, ULTIMATE.start_main_~#t2187~0.base] because there is no mapped edge [2019-12-18 14:47:39,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L802-1-->L804: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2188~0.base_13| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2188~0.base_13|) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t2188~0.base_13|)) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t2188~0.base_13| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2188~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2188~0.base_13|) |v_ULTIMATE.start_main_~#t2188~0.offset_11| 2)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2188~0.base_13| 4)) (= |v_ULTIMATE.start_main_~#t2188~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, ULTIMATE.start_main_~#t2188~0.base=|v_ULTIMATE.start_main_~#t2188~0.base_13|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2188~0.offset=|v_ULTIMATE.start_main_~#t2188~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_~#t2188~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2188~0.offset] because there is no mapped edge [2019-12-18 14:47:39,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L741-->L741-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-1768028383 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1768028383 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1768028383 |P0Thread1of1ForFork0_#t~ite5_Out-1768028383|)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1768028383| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1768028383, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1768028383} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1768028383|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1768028383, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1768028383} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 14:47:39,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L757-2-->L757-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In-1346710167 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1346710167 256) 0))) (or (and (not .cse0) (= ~y$w_buff1~0_In-1346710167 |P1Thread1of1ForFork1_#t~ite9_Out-1346710167|) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite9_Out-1346710167| ~y~0_In-1346710167) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1346710167, ~y$w_buff1~0=~y$w_buff1~0_In-1346710167, ~y~0=~y~0_In-1346710167, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1346710167} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1346710167, ~y$w_buff1~0=~y$w_buff1~0_In-1346710167, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1346710167|, ~y~0=~y~0_In-1346710167, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1346710167} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-18 14:47:39,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd1~0_In1812831523 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1812831523 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In1812831523 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1812831523 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1812831523 |P0Thread1of1ForFork0_#t~ite6_Out1812831523|)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out1812831523| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1812831523, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1812831523, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1812831523, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1812831523} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1812831523|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1812831523, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1812831523, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1812831523, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1812831523} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 14:47:39,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L743-->L744: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1779723032 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1779723032 256)))) (or (and (= ~y$r_buff0_thd1~0_Out1779723032 ~y$r_buff0_thd1~0_In1779723032) (or .cse0 .cse1)) (and (not .cse0) (= 0 ~y$r_buff0_thd1~0_Out1779723032) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1779723032, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1779723032} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1779723032, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1779723032|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1779723032} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 14:47:39,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L744-->L744-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In-1410012305 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-1410012305 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-1410012305 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1410012305 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1410012305| ~y$r_buff1_thd1~0_In-1410012305) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1410012305|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1410012305, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1410012305, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1410012305, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1410012305} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1410012305, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1410012305, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1410012305|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1410012305, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1410012305} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 14:47:39,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L744-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd1~0_50 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_50, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 14:47:39,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L777-2-->L777-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In1316408190 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1316408190 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out1316408190| ~y$w_buff1~0_In1316408190) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite15_Out1316408190| ~y~0_In1316408190) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1316408190, ~y$w_buff1~0=~y$w_buff1~0_In1316408190, ~y~0=~y~0_In1316408190, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1316408190} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1316408190, P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out1316408190|, ~y$w_buff1~0=~y$w_buff1~0_In1316408190, ~y~0=~y~0_In1316408190, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1316408190} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 14:47:39,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-4-->L778: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~y~0_34) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, ~y~0=v_~y~0_34, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~y~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-18 14:47:39,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L757-4-->L758: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~y~0_38) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_7|, ~y~0=v_~y~0_38} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-18 14:47:39,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L758-->L758-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1837080813 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1837080813 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1837080813 |P1Thread1of1ForFork1_#t~ite11_Out1837080813|)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out1837080813|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1837080813, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1837080813} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1837080813, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1837080813, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1837080813|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 14:47:39,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L759-->L759-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In621918602 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In621918602 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In621918602 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In621918602 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out621918602| ~y$w_buff1_used~0_In621918602) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite12_Out621918602| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In621918602, ~y$w_buff0_used~0=~y$w_buff0_used~0_In621918602, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In621918602, ~y$w_buff1_used~0=~y$w_buff1_used~0_In621918602} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In621918602, ~y$w_buff0_used~0=~y$w_buff0_used~0_In621918602, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In621918602, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out621918602|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In621918602} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 14:47:39,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L760-->L760-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In2106044453 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In2106044453 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out2106044453| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out2106044453| ~y$r_buff0_thd2~0_In2106044453) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2106044453, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2106044453} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2106044453, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2106044453, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out2106044453|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 14:47:39,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L761-->L761-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-257635226 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-257635226 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-257635226 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-257635226 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-257635226|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite14_Out-257635226| ~y$r_buff1_thd2~0_In-257635226)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-257635226, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-257635226, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-257635226, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-257635226} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-257635226, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-257635226, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-257635226, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-257635226|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-257635226} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 14:47:39,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-446734727 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-446734727 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out-446734727| 0)) (and (= |P2Thread1of1ForFork2_#t~ite17_Out-446734727| ~y$w_buff0_used~0_In-446734727) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-446734727, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-446734727} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-446734727, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-446734727, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-446734727|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 14:47:39,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In81460860 256))) (.cse0 (= (mod ~y$r_buff1_thd3~0_In81460860 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In81460860 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd3~0_In81460860 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite18_Out81460860|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In81460860 |P2Thread1of1ForFork2_#t~ite18_Out81460860|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In81460860, ~y$w_buff0_used~0=~y$w_buff0_used~0_In81460860, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In81460860, ~y$w_buff1_used~0=~y$w_buff1_used~0_In81460860} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In81460860, ~y$w_buff0_used~0=~y$w_buff0_used~0_In81460860, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In81460860, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out81460860|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In81460860} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-18 14:47:39,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L761-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~y$r_buff1_thd2~0_135 |v_P1Thread1of1ForFork1_#t~ite14_42|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_42|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_135, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_41|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 14:47:39,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-397661689 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-397661689 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite19_Out-397661689|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite19_Out-397661689| ~y$r_buff0_thd3~0_In-397661689)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-397661689, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-397661689} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-397661689, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-397661689, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-397661689|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-18 14:47:39,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L781-->L781-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In1355706722 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In1355706722 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1355706722 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In1355706722 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite20_Out1355706722| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite20_Out1355706722| ~y$r_buff1_thd3~0_In1355706722)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1355706722, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1355706722, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1355706722, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1355706722} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1355706722, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1355706722, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out1355706722|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1355706722, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1355706722} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-18 14:47:39,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L781-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= |v_P2Thread1of1ForFork2_#t~ite20_36| v_~y$r_buff1_thd3~0_132) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_132, P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_35|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite20, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 14:47:39,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L804-1-->L810: Formula: (and (= 3 v_~__unbuffered_cnt~0_18) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 14:47:39,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L810-2-->L810-5: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-762192021 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-762192021 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite25_Out-762192021| |ULTIMATE.start_main_#t~ite24_Out-762192021|))) (or (and (or .cse0 .cse1) (= ~y~0_In-762192021 |ULTIMATE.start_main_#t~ite24_Out-762192021|) .cse2) (and (not .cse0) (= ~y$w_buff1~0_In-762192021 |ULTIMATE.start_main_#t~ite24_Out-762192021|) (not .cse1) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-762192021, ~y~0=~y~0_In-762192021, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-762192021, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-762192021} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-762192021, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-762192021|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-762192021|, ~y~0=~y~0_In-762192021, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-762192021, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-762192021} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-18 14:47:39,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1247768846 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1247768846 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite26_Out1247768846|)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite26_Out1247768846| ~y$w_buff0_used~0_In1247768846)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1247768846, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1247768846} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1247768846, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1247768846, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1247768846|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-18 14:47:39,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L812-->L812-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In613316848 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In613316848 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In613316848 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In613316848 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite27_Out613316848|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite27_Out613316848| ~y$w_buff1_used~0_In613316848)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In613316848, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In613316848, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In613316848, ~y$w_buff1_used~0=~y$w_buff1_used~0_In613316848} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In613316848, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In613316848, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out613316848|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In613316848, ~y$w_buff1_used~0=~y$w_buff1_used~0_In613316848} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-18 14:47:39,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1683731670 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1683731670 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite28_Out-1683731670| ~y$r_buff0_thd0~0_In-1683731670)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite28_Out-1683731670| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1683731670, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1683731670} OutVars{ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-1683731670|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1683731670, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1683731670} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-18 14:47:39,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L814-->L814-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1882316272 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1882316272 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1882316272 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1882316272 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite29_Out-1882316272|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~y$r_buff1_thd0~0_In-1882316272 |ULTIMATE.start_main_#t~ite29_Out-1882316272|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1882316272, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1882316272, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1882316272, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1882316272} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1882316272, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1882316272|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1882316272, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1882316272, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1882316272} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 14:47:39,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L823-->L823-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-336161673 256)))) (or (and (not .cse0) (= ~y$w_buff1~0_In-336161673 |ULTIMATE.start_main_#t~ite39_Out-336161673|) (= |ULTIMATE.start_main_#t~ite38_In-336161673| |ULTIMATE.start_main_#t~ite38_Out-336161673|)) (and (= |ULTIMATE.start_main_#t~ite38_Out-336161673| ~y$w_buff1~0_In-336161673) (= |ULTIMATE.start_main_#t~ite38_Out-336161673| |ULTIMATE.start_main_#t~ite39_Out-336161673|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-336161673 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In-336161673 256) 0)) (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-336161673 256))) (= 0 (mod ~y$w_buff0_used~0_In-336161673 256)))) .cse0))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-336161673, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-336161673, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-336161673, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In-336161673|, ~weak$$choice2~0=~weak$$choice2~0_In-336161673, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-336161673, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-336161673} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-336161673, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-336161673, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-336161673|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-336161673, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-336161673|, ~weak$$choice2~0=~weak$$choice2~0_In-336161673, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-336161673, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-336161673} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 14:47:39,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [809] [809] L824-->L824-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1235839678 256)))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out1235839678| |ULTIMATE.start_main_#t~ite41_Out1235839678|) (= ~y$w_buff0_used~0_In1235839678 |ULTIMATE.start_main_#t~ite41_Out1235839678|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1235839678 256)))) (or (and .cse0 (= (mod ~y$w_buff1_used~0_In1235839678 256) 0)) (and .cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1235839678 256))) (= (mod ~y$w_buff0_used~0_In1235839678 256) 0))) .cse1) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite41_In1235839678| |ULTIMATE.start_main_#t~ite41_Out1235839678|) (= ~y$w_buff0_used~0_In1235839678 |ULTIMATE.start_main_#t~ite42_Out1235839678|)))) InVars {ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_In1235839678|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1235839678, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1235839678, ~weak$$choice2~0=~weak$$choice2~0_In1235839678, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1235839678, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1235839678} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1235839678|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1235839678, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1235839678, ~weak$$choice2~0=~weak$$choice2~0_In1235839678, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1235839678|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1235839678, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1235839678} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 14:47:40,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L826-->L827: Formula: (and (= v_~y$r_buff0_thd0~0_133 v_~y$r_buff0_thd0~0_132) (not (= 0 (mod v_~weak$$choice2~0_33 256)))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_133, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_132, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_22|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_13|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_33} AuxVars[] AssignedVars[~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 14:47:40,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L829-->L832-1: Formula: (and (not (= (mod v_~y$flush_delayed~0_45 256) 0)) (= 0 v_~y$flush_delayed~0_44) (= v_~y~0_135 v_~y$mem_tmp~0_33) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_33, ~y$flush_delayed~0=v_~y$flush_delayed~0_45, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~y$mem_tmp~0=v_~y$mem_tmp~0_33, ~y$flush_delayed~0=v_~y$flush_delayed~0_44, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y~0=v_~y~0_135, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 14:47:40,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L832-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} 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_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 14:47:40,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:47:40 BasicIcfg [2019-12-18 14:47:40,084 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:47:40,086 INFO L168 Benchmark]: Toolchain (without parser) took 68467.08 ms. Allocated memory was 145.2 MB in the beginning and 3.0 GB in the end (delta: 2.9 GB). Free memory was 100.1 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 726.9 MB. Max. memory is 7.1 GB. [2019-12-18 14:47:40,086 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 14:47:40,087 INFO L168 Benchmark]: CACSL2BoogieTranslator took 796.94 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 99.7 MB in the beginning and 156.7 MB in the end (delta: -57.0 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-18 14:47:40,087 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.25 ms. Allocated memory is still 202.9 MB. Free memory was 156.0 MB in the beginning and 153.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 14:47:40,088 INFO L168 Benchmark]: Boogie Preprocessor took 41.36 ms. Allocated memory is still 202.9 MB. Free memory was 153.4 MB in the beginning and 150.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 14:47:40,089 INFO L168 Benchmark]: RCFGBuilder took 859.29 ms. Allocated memory is still 202.9 MB. Free memory was 150.8 MB in the beginning and 101.4 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. [2019-12-18 14:47:40,089 INFO L168 Benchmark]: TraceAbstraction took 66695.76 ms. Allocated memory was 202.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 100.8 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 669.9 MB. Max. memory is 7.1 GB. [2019-12-18 14:47:40,093 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 796.94 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 99.7 MB in the beginning and 156.7 MB in the end (delta: -57.0 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.25 ms. Allocated memory is still 202.9 MB. Free memory was 156.0 MB in the beginning and 153.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.36 ms. Allocated memory is still 202.9 MB. Free memory was 153.4 MB in the beginning and 150.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 859.29 ms. Allocated memory is still 202.9 MB. Free memory was 150.8 MB in the beginning and 101.4 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 66695.76 ms. Allocated memory was 202.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 100.8 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 669.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 173 ProgramPointsBefore, 94 ProgramPointsAfterwards, 210 TransitionsBefore, 104 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 39 ConcurrentYvCompositions, 31 ChoiceCompositions, 5882 VarBasedMoverChecksPositive, 246 VarBasedMoverChecksNegative, 66 SemBasedMoverChecksPositive, 253 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 78185 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t2186, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L730] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L731] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L732] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L733] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L734] 1 y$r_buff0_thd1 = (_Bool)1 [L737] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L802] FCALL, FORK 0 pthread_create(&t2187, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L804] FCALL, FORK 0 pthread_create(&t2188, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L771] 3 __unbuffered_p2_EAX = x [L774] 3 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L777] 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L758] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L759] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L760] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L778] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L780] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L810] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 0 y$flush_delayed = weak$$choice2 [L820] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L825] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L827] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 164 locations, 2 error locations. Result: UNSAFE, OverallTime: 66.4s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 13.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2651 SDtfs, 2177 SDslu, 4656 SDs, 0 SdLazy, 3260 SolverSat, 139 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 142 GetRequests, 39 SyntacticMatches, 18 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156321occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 28.8s AutomataMinimizationTime, 17 MinimizatonAttempts, 55130 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 845 NumberOfCodeBlocks, 845 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 760 ConstructedInterpolants, 0 QuantifiedInterpolants, 128335 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...